Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1000000011100000000101 |
3 | 1022210121112122111012111012 |
4 | 2103020231020003200011 |
5 | 2311130023141212442 |
6 | 33300551352052005 |
7 | 2062334506540643 |
oct | 223105510034005 |
9 | 38717478435435 |
10 | 10111110100997 |
11 | 3249109068474 |
12 | 1173726394005 |
13 | 584620631909 |
14 | 26d547920193 |
15 | 12802e719582 |
hex | 9322d203805 |
10111110100997 has 2 divisors, whose sum is σ = 10111110100998. Its totient is φ = 10111110100996.
The previous prime is 10111110100969. The next prime is 10111110101017. The reversal of 10111110100997 is 79900101111101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8950472326756 + 1160637774241 = 2991734^2 + 1077329^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111110100997 - 26 = 10111110100933 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111110100957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055555050498 + 5055555050499.
It is an arithmetic number, because the mean of its divisors is an integer number (5055555050499).
Almost surely, 210111110100997 is an apocalyptic number.
It is an amenable number.
10111110100997 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111110100997 is an equidigital number, since it uses as much as digits as its factorization.
10111110100997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 32.
The spelling of 10111110100997 in words is "ten trillion, one hundred eleven billion, one hundred ten million, one hundred thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •