Base | Representation |
---|---|
bin | 1011000110101101111000… |
… | …0001111101101101101111 |
3 | 1121020021012102201211112022 |
4 | 2301223132001331231233 |
5 | 3100022111130041421 |
6 | 41545112352500355 |
7 | 2400100505345165 |
oct | 261533601755557 |
9 | 47207172654468 |
10 | 12210022112111 |
11 | 398827219318a |
12 | 145247384a6bb |
13 | 6a752816bac5 |
14 | 302d7ab3b235 |
15 | 16292616e7ab |
hex | b1ade07db6f |
12210022112111 has 8 divisors (see below), whose sum is σ = 12469896972480. Its totient is φ = 11950150883328.
The previous prime is 12210022112081. The next prime is 12210022112179. The reversal of 12210022112111 is 11121122001221.
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 12210022112111 - 214 = 12210022095727 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 12210022112111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210028112111) 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, 6529535 + ... + 8188703.
It is an arithmetic number, because the mean of its divisors is an integer number (1558737121560).
Almost surely, 212210022112111 is an apocalyptic number.
12210022112111 is a deficient number, since it is larger than the sum of its proper divisors (259874860369).
12210022112111 is a wasteful number, since it uses less digits than its factorization.
12210022112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1815793.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12210022112111 its reverse (11121122001221), we get a palindrome (23331144113332).
The spelling of 12210022112111 in words is "twelve trillion, two hundred ten billion, twenty-two million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •