Base | Representation |
---|---|
bin | 10111001100010011111011… |
… | …111111101011100011011011 |
3 | 111101011012200210221010110202 |
4 | 113030103323333223203123 |
5 | 101332141233421320331 |
6 | 1000534355154532415 |
7 | 30325223423046431 |
oct | 2714237377534333 |
9 | 441135623833422 |
10 | 102001111120091 |
11 | 2a556479077a27 |
12 | b5345b989710b |
13 | 44bb881952611 |
14 | 1b28c47096d51 |
15 | bbd43a0ccecb |
hex | 5cc4fbfeb8db |
102001111120091 has 2 divisors, whose sum is σ = 102001111120092. Its totient is φ = 102001111120090.
The previous prime is 102001111120021. The next prime is 102001111120157. The reversal of 102001111120091 is 190021111100201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102001111120091 - 214 = 102001111103707 is a prime.
It is not a weakly prime, because it can be changed into another prime (102001111120021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000555560045 + 51000555560046.
It is an arithmetic number, because the mean of its divisors is an integer number (51000555560046).
Almost surely, 2102001111120091 is an apocalyptic number.
102001111120091 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001111120091 is an equidigital number, since it uses as much as digits as its factorization.
102001111120091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
Adding to 102001111120091 its reverse (190021111100201), we get a palindrome (292022222220292).
The spelling of 102001111120091 in words is "one hundred two trillion, one billion, one hundred eleven million, one hundred twenty thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •