Base | Representation |
---|---|
bin | 1001011011010100… |
… | …01011101101000101 |
3 | 111001201011102211122 |
4 | 10231222023231011 |
5 | 40331104000010 |
6 | 2154110443325 |
7 | 236262535025 |
oct | 45552135505 |
9 | 14051142748 |
10 | 5061000005 |
11 | 2167891236 |
12 | b92b03545 |
13 | 628698a79 |
14 | 36021da85 |
15 | 1e94a5855 |
hex | 12da8bb45 |
5061000005 has 8 divisors (see below), whose sum is σ = 6079154424. Its totient is φ = 4044830400.
The previous prime is 5060999969. The next prime is 5061000013. The reversal of 5061000005 is 5000001605.
It can be written as a sum of positive squares in 4 ways, for example, as 774286276 + 4286713729 = 27826^2 + 65473^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5061000005 - 212 = 5060995909 is a prime.
It is a super-2 number, since 2×50610000052 = 51227442101220000050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 490586 + ... + 500795.
It is an arithmetic number, because the mean of its divisors is an integer number (759894303).
Almost surely, 25061000005 is an apocalyptic number.
It is an amenable number.
5061000005 is a deficient number, since it is larger than the sum of its proper divisors (1018154419).
5061000005 is a wasteful number, since it uses less digits than its factorization.
5061000005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 992407.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 5061000005 is about 71140.7056824713. The cubic root of 5061000005 is about 1716.9017603481.
The spelling of 5061000005 in words is "five billion, sixty-one million, five", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •