Base | Representation |
---|---|
bin | 10111001100011110000101… |
… | …101111001111011101010111 |
3 | 111101012020211111212021000211 |
4 | 113030132011233033131113 |
5 | 101332331100033013421 |
6 | 1000543401002350251 |
7 | 30326060520026602 |
oct | 2714360557173527 |
9 | 441166744767024 |
10 | 102012012001111 |
11 | 2a560062366203 |
12 | b5367404bb387 |
13 | 44bc8cb184484 |
14 | 1b2959cb25339 |
15 | bbd8770dd9e1 |
hex | 5cc785bcf757 |
102012012001111 has 2 divisors, whose sum is σ = 102012012001112. Its totient is φ = 102012012001110.
The previous prime is 102012012001057. The next prime is 102012012001147. The reversal of 102012012001111 is 111100210210201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102012012001111 - 235 = 101977652262743 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102012012001091 and 102012012001100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102012012001411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51006006000555 + 51006006000556.
It is an arithmetic number, because the mean of its divisors is an integer number (51006006000556).
Almost surely, 2102012012001111 is an apocalyptic number.
102012012001111 is a deficient number, since it is larger than the sum of its proper divisors (1).
102012012001111 is an equidigital number, since it uses as much as digits as its factorization.
102012012001111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102012012001111 its reverse (111100210210201), we get a palindrome (213112222211312).
The spelling of 102012012001111 in words is "one hundred two trillion, twelve billion, twelve million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •