Base | Representation |
---|---|
bin | 1001001010110011000100… |
… | …0010111100110111110101 |
3 | 1022200202002222002002202011 |
4 | 2102230301002330313311 |
5 | 2310132103420212132 |
6 | 33235110513244221 |
7 | 2060223221335213 |
oct | 222546102746765 |
9 | 38622088062664 |
10 | 10081111100917 |
11 | 323741444771a |
12 | 1169953863671 |
13 | 58184c5299ac |
14 | 26bcdd695cb3 |
15 | 127375c3bb47 |
hex | 92b310bcdf5 |
10081111100917 has 2 divisors, whose sum is σ = 10081111100918. Its totient is φ = 10081111100916.
The previous prime is 10081111100849. The next prime is 10081111100927. The reversal of 10081111100917 is 71900111118001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9920950260516 + 160160840401 = 3149754^2 + 400201^2 .
It is a cyclic number.
It is not a de Polignac number, because 10081111100917 - 227 = 10080976883189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10081111100927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5040555550458 + 5040555550459.
It is an arithmetic number, because the mean of its divisors is an integer number (5040555550459).
Almost surely, 210081111100917 is an apocalyptic number.
It is an amenable number.
10081111100917 is a deficient number, since it is larger than the sum of its proper divisors (1).
10081111100917 is an equidigital number, since it uses as much as digits as its factorization.
10081111100917 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 31.
Adding to 10081111100917 its reverse (71900111118001), we get a palindrome (81981222218918).
The spelling of 10081111100917 in words is "ten trillion, eighty-one billion, one hundred eleven million, one hundred thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •