Base | Representation |
---|---|
bin | 1011000110110101010010… |
… | …0001100010010110001111 |
3 | 1121020110022222111002101111 |
4 | 2301231110201202112033 |
5 | 3100040144041200421 |
6 | 41550041530152451 |
7 | 2400200665100443 |
oct | 261552441422617 |
9 | 47213288432344 |
10 | 12212010100111 |
11 | 39890a2375a78 |
12 | 1452929582727 |
13 | 6a7783c9b873 |
14 | 3030c8b8a823 |
15 | 1629e095cee1 |
hex | b1b5486258f |
12212010100111 has 8 divisors (see below), whose sum is σ = 12606245789184. Its totient is φ = 11817793153560.
The previous prime is 12212010100051. The next prime is 12212010100127. The reversal of 12212010100111 is 11100101021221.
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 12212010100111 - 211 = 12212010098063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12212010100091 and 12212010100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12212010106111) 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, 3355465 + ... + 5973538.
It is an arithmetic number, because the mean of its divisors is an integer number (1575780723648).
Almost surely, 212212010100111 is an apocalyptic number.
12212010100111 is a deficient number, since it is larger than the sum of its proper divisors (394235689073).
12212010100111 is an equidigital number, since it uses as much as digits as its factorization.
12212010100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9371261.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12212010100111 its reverse (11100101021221), we get a palindrome (23312111121332).
The spelling of 12212010100111 in words is "twelve trillion, two hundred twelve billion, ten million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •