Base | Representation |
---|---|
bin | 1011000111010011000011… |
… | …1000100110001110001110 |
3 | 1121021012221221211202100110 |
4 | 2301310300320212032032 |
5 | 3100203031014200420 |
6 | 41553442542340450 |
7 | 2400603021011130 |
oct | 261646070461616 |
9 | 47235857752313 |
10 | 12220002100110 |
11 | 3991523679952 |
12 | 1454399b8a726 |
13 | 6a845897054c |
14 | 303646371050 |
15 | 162d0c3c7ee0 |
hex | b1d30e2638e |
12220002100110 has 256 divisors, whose sum is σ = 35274755432448. Its totient is φ = 2650500403200.
The previous prime is 12220002100109. The next prime is 12220002100171. The reversal of 12220002100110 is 1100120002221.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1666436004 + ... + 1666443336.
It is an arithmetic number, because the mean of its divisors is an integer number (137792013408).
Almost surely, 212220002100110 is an apocalyptic number.
12220002100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12220002100110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17637377716224).
12220002100110 is an abundant number, since it is smaller than the sum of its proper divisors (23054753332338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12220002100110 is a wasteful number, since it uses less digits than its factorization.
12220002100110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12659.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12220002100110 its reverse (1100120002221), we get a palindrome (13320122102331).
The spelling of 12220002100110 in words is "twelve trillion, two hundred twenty billion, two million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •