Base | Representation |
---|---|
bin | 1011000111010110110001… |
… | …1111110000000111101011 |
3 | 1121021022112122202002221021 |
4 | 2301311230133300013223 |
5 | 3100212103032020021 |
6 | 41554130110353311 |
7 | 2400636553621444 |
oct | 261655437600753 |
9 | 47238478662837 |
10 | 12221002220011 |
11 | 3991997174822 |
12 | 1454618abb837 |
13 | 6a8587c20180 |
14 | 3036dd1102cb |
15 | 162d6a0cec41 |
hex | b1d6c7f01eb |
12221002220011 has 8 divisors (see below), whose sum is σ = 13223454100304. Its totient is φ = 11227461023520.
The previous prime is 12221002219981. The next prime is 12221002220041. The reversal of 12221002220011 is 11002220012221.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12221002219981) and next prime (12221002220041).
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 12221002220011 - 227 = 12220868002283 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12221002220041) 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, 2227668096 + ... + 2227673581.
It is an arithmetic number, because the mean of its divisors is an integer number (1652931762538).
Almost surely, 212221002220011 is an apocalyptic number.
12221002220011 is a deficient number, since it is larger than the sum of its proper divisors (1002451880293).
12221002220011 is a wasteful number, since it uses less digits than its factorization.
12221002220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4455341901.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12221002220011 its reverse (11002220012221), we get a palindrome (23223222232232).
The spelling of 12221002220011 in words is "twelve trillion, two hundred twenty-one billion, two million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •