Base | Representation |
---|---|
bin | 1011000110101110001111… |
… | …1011100100101110101010 |
3 | 1121020021110022222221122220 |
4 | 2301223203323210232222 |
5 | 3100022312000201302 |
6 | 41545130250254510 |
7 | 2400103116624204 |
oct | 261534373445652 |
9 | 47207408887586 |
10 | 12210121100202 |
11 | 3988313053423 |
12 | 14524a0a27436 |
13 | 6a7542819b3c |
14 | 302d89d47774 |
15 | 16292ebc44bc |
hex | b1ae3ee4baa |
12210121100202 has 16 divisors (see below), whose sum is σ = 24566471197632. Its totient is φ = 4045668867200.
The previous prime is 12210121100197. The next prime is 12210121100207. The reversal of 12210121100202 is 20200112101221.
It is an interprime number because it is at equal distance from previous prime (12210121100197) and next prime (12210121100207).
It is a super-5 number, since 5×122101211002025 (a number of 67 digits) contains 55555 as substring.
It is not an unprimeable number, because it can be changed into a prime (12210121100207) 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, 6092873799 + ... + 6092875802.
It is an arithmetic number, because the mean of its divisors is an integer number (1535404449852).
Almost surely, 212210121100202 is an apocalyptic number.
12210121100202 is an abundant number, since it is smaller than the sum of its proper divisors (12356350097430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12210121100202 is a wasteful number, since it uses less digits than its factorization.
12210121100202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12185749773.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12210121100202 its reverse (20200112101221), we get a palindrome (32410233201423).
The spelling of 12210121100202 in words is "twelve trillion, two hundred ten billion, one hundred twenty-one million, one hundred thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •