Base | Representation |
---|---|
bin | 1010111011001100101000… |
… | …1101111110101111011111 |
3 | 1120112100101101021222121201 |
4 | 2232303022031332233133 |
5 | 3033301311013101421 |
6 | 41314143045540331 |
7 | 2346563363500333 |
oct | 256631215765737 |
9 | 46470341258551 |
10 | 12012121222111 |
11 | 391134830243a |
12 | 14200431146a7 |
13 | 6919799b866a |
14 | 2d75657537c3 |
15 | 15c6e2138b91 |
hex | aecca37ebdf |
12012121222111 has 8 divisors (see below), whose sum is σ = 12128931438624. Its totient is φ = 11895314615040.
The previous prime is 12012121222081. The next prime is 12012121222117. The reversal of 12012121222111 is 11122212121021.
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 12012121222111 - 237 = 11874682268639 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12012121222117) 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 in 7 ways as a sum of consecutive naturals, for example, 6044715 + ... + 7782211.
It is an arithmetic number, because the mean of its divisors is an integer number (1516116429828).
Almost surely, 212012121222111 is an apocalyptic number.
12012121222111 is a deficient number, since it is larger than the sum of its proper divisors (116810216513).
12012121222111 is a wasteful number, since it uses less digits than its factorization.
12012121222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1804721.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 12012121222111 its reverse (11122212121021), we get a palindrome (23134333343132).
The spelling of 12012121222111 in words is "twelve trillion, twelve billion, one hundred twenty-one million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •