Base | Representation |
---|---|
bin | 1011000111010011000011… |
… | …0001010110100110001101 |
3 | 1121021012221211021021101210 |
4 | 2301310300301112212031 |
5 | 3100203030022413401 |
6 | 41553442433525033 |
7 | 2400602665611510 |
oct | 261646061264615 |
9 | 47235854237353 |
10 | 12220000201101 |
11 | 39915225a2120 |
12 | 1454399413779 |
13 | 6a8458457084 |
14 | 303645dd8d77 |
15 | 162d0c1504d6 |
hex | b1d30c5698d |
12220000201101 has 128 divisors (see below), whose sum is σ = 20876471304192. Its totient is φ = 6174923040000.
The previous prime is 12220000201051. The next prime is 12220000201103. The reversal of 12220000201101 is 10110200002221.
It is not a de Polignac number, because 12220000201101 - 215 = 12220000168333 is a prime.
It is a super-2 number, since 2×122200002011012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220000201103) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 598686586 + ... + 598706996.
It is an arithmetic number, because the mean of its divisors is an integer number (163097432064).
Almost surely, 212220000201101 is an apocalyptic number.
12220000201101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12220000201101 is a deficient number, since it is larger than the sum of its proper divisors (8656471103091).
12220000201101 is a wasteful number, since it uses less digits than its factorization.
12220000201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20983.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12220000201101 its reverse (10110200002221), we get a palindrome (22330200203322).
The spelling of 12220000201101 in words is "twelve trillion, two hundred twenty billion, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •