Base | Representation |
---|---|
bin | 1001000110011001100111… |
… | …1010011001100011111111 |
3 | 1022102112002202100010211102 |
4 | 2101212121322121203333 |
5 | 2302412342112233422 |
6 | 33140254041443315 |
7 | 2051610062500124 |
oct | 221463172314377 |
9 | 38375082303742 |
10 | 10005561055487 |
11 | 320837540a348 |
12 | 115718a1a053b |
13 | 57769c2c86ba |
14 | 2683b391a74b |
15 | 125403273192 |
hex | 91999e998ff |
10005561055487 has 2 divisors, whose sum is σ = 10005561055488. Its totient is φ = 10005561055486.
The previous prime is 10005561055463. The next prime is 10005561055559. The reversal of 10005561055487 is 78455016550001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10005561055487 - 216 = 10005560989951 is a prime.
It is a super-2 number, since 2×100055610554872 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10005561055417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5002780527743 + 5002780527744.
It is an arithmetic number, because the mean of its divisors is an integer number (5002780527744).
Almost surely, 210005561055487 is an apocalyptic number.
10005561055487 is a deficient number, since it is larger than the sum of its proper divisors (1).
10005561055487 is an equidigital number, since it uses as much as digits as its factorization.
10005561055487 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840000, while the sum is 47.
The spelling of 10005561055487 in words is "ten trillion, five billion, five hundred sixty-one million, fifty-five thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •