{"id":50509700,"url":"https://github.com/fellipef/divisor","last_synced_at":"2026-06-02T19:01:12.721Z","repository":{"id":206592704,"uuid":"717254864","full_name":"FellipeF/divisor","owner":"FellipeF","description":"Leia um número inteiro e calcule todos seus divisores","archived":false,"fork":false,"pushed_at":"2024-06-27T21:21:58.000Z","size":19,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-06-28T00:04:29.976Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/FellipeF.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-11-10T23:28:10.000Z","updated_at":"2024-06-27T21:22:01.000Z","dependencies_parsed_at":null,"dependency_job_id":"3e07f6c3-ba06-4a70-abe0-3f4f90a8a01f","html_url":"https://github.com/FellipeF/divisor","commit_stats":null,"previous_names":["fellipef/divisor"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/FellipeF/divisor","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FellipeF%2Fdivisor","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FellipeF%2Fdivisor/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FellipeF%2Fdivisor/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FellipeF%2Fdivisor/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/FellipeF","download_url":"https://codeload.github.com/FellipeF/divisor/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FellipeF%2Fdivisor/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33833277,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-02T02:00:07.132Z","response_time":109,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2026-06-02T19:01:09.266Z","updated_at":"2026-06-02T19:01:12.699Z","avatar_url":"https://github.com/FellipeF.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# divisor\nUm programa que lê um número inteiro e calcula todos seus divisores. Ideal para cálculo de números primos grandes, porém computacionalmente viáveis de calcular, vistos em implementações teóricas e de aprendizado sobre o algoritmo criptográfico RSA, onde um primo **n** é resultado da multiplicação de dois outros números primos, p e q.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffellipef%2Fdivisor","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffellipef%2Fdivisor","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffellipef%2Fdivisor/lists"}