Base | Representation |
---|---|
bin | 10111001100011100010100… |
… | …011011100101010000011011 |
3 | 111101012001221000211112002001 |
4 | 113030130110123211100123 |
5 | 101332313201410201412 |
6 | 1000542444214021431 |
7 | 30325662435002011 |
oct | 2714342433452033 |
9 | 441161830745061 |
10 | 102010111022107 |
11 | 2a55a277301582 |
12 | b5362ab947877 |
13 | 44bc68739a122 |
14 | 1b2945c4848b1 |
15 | bbd7b528a957 |
hex | 5cc7146e541b |
102010111022107 has 2 divisors, whose sum is σ = 102010111022108. Its totient is φ = 102010111022106.
The previous prime is 102010111022081. The next prime is 102010111022137. The reversal of 102010111022107 is 701220111010201.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102010111022107 is a prime.
It is not a weakly prime, because it can be changed into another prime (102010111022137) 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, 51005055511053 + 51005055511054.
It is an arithmetic number, because the mean of its divisors is an integer number (51005055511054).
Almost surely, 2102010111022107 is an apocalyptic number.
102010111022107 is a deficient number, since it is larger than the sum of its proper divisors (1).
102010111022107 is an equidigital number, since it uses as much as digits as its factorization.
102010111022107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 102010111022107 its reverse (701220111010201), we get a palindrome (803230222032308).
The spelling of 102010111022107 in words is "one hundred two trillion, ten billion, one hundred eleven million, twenty-two thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •