Base | Representation |
---|---|
bin | 1010111011000101100001… |
… | …0011010111001000011111 |
3 | 1120112011110012001101001211 |
4 | 2232301120103113020133 |
5 | 3033233402231430421 |
6 | 41313225254245251 |
7 | 2346465125565106 |
oct | 256613023271037 |
9 | 46464405041054 |
10 | 12010210030111 |
11 | 3910557502617 |
12 | 141b7ab056827 |
13 | 691733a66817 |
14 | 2d74239b503d |
15 | 15c62e4699e1 |
hex | aec584d721f |
12010210030111 has 2 divisors, whose sum is σ = 12010210030112. Its totient is φ = 12010210030110.
The previous prime is 12010210030109. The next prime is 12010210030199. The reversal of 12010210030111 is 11103001201021.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12010210030111 - 21 = 12010210030109 is a prime.
Together with 12010210030109, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12010210030091 and 12010210030100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12010210030211) 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, 6005105015055 + 6005105015056.
It is an arithmetic number, because the mean of its divisors is an integer number (6005105015056).
Almost surely, 212010210030111 is an apocalyptic number.
12010210030111 is a deficient number, since it is larger than the sum of its proper divisors (1).
12010210030111 is an equidigital number, since it uses as much as digits as its factorization.
12010210030111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 12010210030111 its reverse (11103001201021), we get a palindrome (23113211231132).
The spelling of 12010210030111 in words is "twelve trillion, ten billion, two hundred ten million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •