Base | Representation |
---|---|
bin | 1001001001100100101000… |
… | …00000111110111011110010 |
3 | 2122020110112001210210020202 |
4 | 10210302110000332323302 |
5 | 10114121441141201320 |
6 | 110443015002235202 |
7 | 4144426041024101 |
oct | 444622400767362 |
9 | 78213461723222 |
10 | 20120110100210 |
11 | 645798869206a |
12 | 230b4b41b5b02 |
13 | b2c41a239c53 |
14 | 4d7b66064038 |
15 | 24d584838b75 |
hex | 124c9403eef2 |
20120110100210 has 8 divisors (see below), whose sum is σ = 36216198180396. Its totient is φ = 8048044040080.
The previous prime is 20120110100201. The next prime is 20120110100219. The reversal of 20120110100210 is 1200101102102.
It is an interprime number because it is at equal distance from previous prime (20120110100201) and next prime (20120110100219).
It can be written as a sum of positive squares in 2 ways, for example, as 19603987114321 + 516122985889 = 4427639^2 + 718417^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 20120110100191 and 20120110100200.
It is not an unprimeable number, because it can be changed into a prime (20120110100219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1006005505001 + ... + 1006005505020.
Almost surely, 220120110100210 is an apocalyptic number.
20120110100210 is a deficient number, since it is larger than the sum of its proper divisors (16096088080186).
20120110100210 is a wasteful number, since it uses less digits than its factorization.
20120110100210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2012011010028.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20120110100210 its reverse (1200101102102), we get a palindrome (21320211202312).
The spelling of 20120110100210 in words is "twenty trillion, one hundred twenty billion, one hundred ten million, one hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •