Base | Representation |
---|---|
bin | 1001000110011010010000… |
… | …0100100110001110110011 |
3 | 1022102112112122001200002102 |
4 | 2101212210010212032303 |
5 | 2302413214231012404 |
6 | 33140323011011015 |
7 | 2051614232322554 |
oct | 221464404461663 |
9 | 38375478050072 |
10 | 10005731500979 |
11 | 3208452646595 |
12 | 1157217299a6b |
13 | 5776c8705716 |
14 | 2683cc40832b |
15 | 1254131e071e |
hex | 919a41263b3 |
10005731500979 has 2 divisors, whose sum is σ = 10005731500980. Its totient is φ = 10005731500978.
The previous prime is 10005731500969. The next prime is 10005731501023. The reversal of 10005731500979 is 97900513750001.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10005731500979 is a prime.
It is a super-2 number, since 2×100057315009792 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10005731500909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5002865750489 + 5002865750490.
It is an arithmetic number, because the mean of its divisors is an integer number (5002865750490).
Almost surely, 210005731500979 is an apocalyptic number.
10005731500979 is a deficient number, since it is larger than the sum of its proper divisors (1).
10005731500979 is an equidigital number, since it uses as much as digits as its factorization.
10005731500979 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 297675, while the sum is 47.
The spelling of 10005731500979 in words is "ten trillion, five billion, seven hundred thirty-one million, five hundred thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •