Base | Representation |
---|---|
bin | 1010111011000101100001… |
… | …1011010000100000001111 |
3 | 1120112011110022221112120111 |
4 | 2232301120123100200033 |
5 | 3033233403244200421 |
6 | 41313225410500451 |
7 | 2346465152306101 |
oct | 256613033204017 |
9 | 46464408845514 |
10 | 12010212100111 |
11 | 3910558696865 |
12 | 141b7ab894727 |
13 | 69173430ca84 |
14 | 2d7423d93571 |
15 | 15c62e727ee1 |
hex | aec586d080f |
12010212100111 has 8 divisors (see below), whose sum is σ = 12017821971584. Its totient is φ = 12002604568920.
The previous prime is 12010212100057. The next prime is 12010212100153. The reversal of 12010212100111 is 11100121201021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12010212100111 - 223 = 12010203711503 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12010212100091 and 12010212100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12010212110111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9739696 + ... + 10903306.
It is an arithmetic number, because the mean of its divisors is an integer number (1502227746448).
Almost surely, 212010212100111 is an apocalyptic number.
12010212100111 is a deficient number, since it is larger than the sum of its proper divisors (7609871473).
12010212100111 is a wasteful number, since it uses less digits than its factorization.
12010212100111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1170141.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12010212100111 its reverse (11100121201021), we get a palindrome (23110333301132).
The spelling of 12010212100111 in words is "twelve trillion, ten billion, two hundred twelve million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •