Base | Representation |
---|---|
bin | 1011000110101110100111… |
… | …1101001111010011001011 |
3 | 1121020021201101020100112021 |
4 | 2301223221331033103023 |
5 | 3100023013340400021 |
6 | 41545144301225311 |
7 | 2400105455146633 |
oct | 261535175172313 |
9 | 47207641210467 |
10 | 12210222200011 |
11 | 3988365126190 |
12 | 145250a862237 |
13 | 6a755a757104 |
14 | 302d995436c3 |
15 | 1629389e4c41 |
hex | b1ae9f4f4cb |
12210222200011 has 16 divisors (see below), whose sum is σ = 13333658738688. Its totient is φ = 11089024408000.
The previous prime is 12210222199999. The next prime is 12210222200051. The reversal of 12210222200011 is 11000222201221.
It is a happy number.
It is not a de Polignac number, because 12210222200011 - 219 = 12210221675723 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12210222200051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 97085010 + ... + 97210696.
It is an arithmetic number, because the mean of its divisors is an integer number (833353671168).
Almost surely, 212210222200011 is an apocalyptic number.
12210222200011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12210222200011 is a deficient number, since it is larger than the sum of its proper divisors (1123436538677).
12210222200011 is a wasteful number, since it uses less digits than its factorization.
12210222200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134522.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12210222200011 its reverse (11000222201221), we get a palindrome (23210444401232).
It can be divided in two parts, 12210222 and 200011, that multiplied together give a palindrome (2442178712442).
The spelling of 12210222200011 in words is "twelve trillion, two hundred ten billion, two hundred twenty-two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •