Base | Representation |
---|---|
bin | 1001000111010011011101… |
… | …1000111101000000100101 |
3 | 1022111000011212000010111112 |
4 | 2101310313120331000211 |
5 | 2303141142011133142 |
6 | 33151342501514405 |
7 | 2052666621323153 |
oct | 221646730750045 |
9 | 38430155003445 |
10 | 10021087989797 |
11 | 3213a12a14965 |
12 | 115a1a2112a05 |
13 | 578ca506a2b1 |
14 | 269047b083d3 |
15 | 125a11471382 |
hex | 91d3763d025 |
10021087989797 has 2 divisors, whose sum is σ = 10021087989798. Its totient is φ = 10021087989796.
The previous prime is 10021087989733. The next prime is 10021087989851. The reversal of 10021087989797 is 79798978012001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6828322967236 + 3192765022561 = 2613106^2 + 1786831^2 .
It is an emirp because it is prime and its reverse (79798978012001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10021087989797 - 26 = 10021087989733 is a prime.
It is a super-2 number, since 2×100210879897972 (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 (10021087989397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010543994898 + 5010543994899.
It is an arithmetic number, because the mean of its divisors is an integer number (5010543994899).
Almost surely, 210021087989797 is an apocalyptic number.
It is an amenable number.
10021087989797 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021087989797 is an equidigital number, since it uses as much as digits as its factorization.
10021087989797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32006016, while the sum is 68.
The spelling of 10021087989797 in words is "ten trillion, twenty-one billion, eighty-seven million, nine hundred eighty-nine thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •