Base | Representation |
---|---|
bin | 1011000110101110001010… |
… | …1011000101100101100001 |
3 | 1121020021101212022000011110 |
4 | 2301223202223011211201 |
5 | 3100022241100013441 |
6 | 41545124214133533 |
7 | 2400102442366641 |
oct | 261534253054541 |
9 | 47207355260143 |
10 | 12210100001121 |
11 | 3988302152370 |
12 | 14524959512a9 |
13 | 6a753b340389 |
14 | 302d87214521 |
15 | 16292ce07b16 |
hex | b1ae2ac5961 |
12210100001121 has 32 divisors (see below), whose sum is σ = 18248712708096. Its totient is φ = 7196678712000.
The previous prime is 12210100001107. The next prime is 12210100001137. The reversal of 12210100001121 is 12110000101221.
It is not a de Polignac number, because 12210100001121 - 217 = 12210099870049 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12210100001097 and 12210100001106.
It is not an unprimeable number, because it can be changed into a prime (12210100001101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 255616 + ... + 4948286.
It is an arithmetic number, because the mean of its divisors is an integer number (570272272128).
Almost surely, 212210100001121 is an apocalyptic number.
12210100001121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12210100001121 is a deficient number, since it is larger than the sum of its proper divisors (6038612706975).
12210100001121 is a wasteful number, since it uses less digits than its factorization.
12210100001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4694853.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12210100001121 its reverse (12110000101221), we get a palindrome (24320100102342).
The spelling of 12210100001121 in words is "twelve trillion, two hundred ten billion, one hundred million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •