Base | Representation |
---|---|
bin | 10001101000111101010… |
… | …110101000110101111111 |
3 | 11021212221000012120200022 |
4 | 101220331112220311333 |
5 | 124330101242401421 |
6 | 2324514233522355 |
7 | 153402461012462 |
oct | 21507526506577 |
9 | 4255830176608 |
10 | 1212210122111 |
11 | 4281060145aa |
12 | 176b268733bb |
13 | 8a40713bb31 |
14 | 429580012d9 |
15 | 217ebb147ab |
hex | 11a3d5a8d7f |
1212210122111 has 8 divisors (see below), whose sum is σ = 1216199051760. Its totient is φ = 1208221455168.
The previous prime is 1212210122083. The next prime is 1212210122143. The reversal of 1212210122111 is 1112210122121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1212210122111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1212210122111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212210122161) 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, 14373755 + ... + 14457843.
It is an arithmetic number, because the mean of its divisors is an integer number (152024881470).
Almost surely, 21212210122111 is an apocalyptic number.
1212210122111 is a deficient number, since it is larger than the sum of its proper divisors (3988929649).
1212210122111 is an equidigital number, since it uses as much as digits as its factorization.
1212210122111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131353.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1212210122111 its reverse (1112210122121), we get a palindrome (2324420244232).
The spelling of 1212210122111 in words is "one trillion, two hundred twelve billion, two hundred ten million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •