Base | Representation |
---|---|
bin | 101111110001010110111111… |
… | …001001101010100000110000 |
3 | 1000112220101010202110001200120 |
4 | 233301112333021222200300 |
5 | 210014240022240400422 |
6 | 2022502355204450240 |
7 | 62153142613434144 |
oct | 5761267711524060 |
9 | 1015811122401616 |
10 | 210100122200112 |
11 | 60a42a637571a1 |
12 | 1b6929899a9980 |
13 | 90304833412a1 |
14 | 39c4c86103224 |
15 | 19452bdd0945c |
hex | bf15bf26a830 |
210100122200112 has 80 divisors (see below), whose sum is σ = 566822226055680. Its totient is φ = 66933400416256.
The previous prime is 210100122200083. The next prime is 210100122200131. The reversal of 210100122200112 is 211002221001012.
It is a super-2 number, since 2×2101001222001122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210100122200091 and 210100122200100.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76843812 + ... + 79530947.
It is an arithmetic number, because the mean of its divisors is an integer number (7085277825696).
Almost surely, 2210100122200112 is an apocalyptic number.
It is an amenable number.
210100122200112 is an abundant number, since it is smaller than the sum of its proper divisors (356722103855568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210100122200112 is a wasteful number, since it uses less digits than its factorization.
210100122200112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156376010 (or 156376004 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210100122200112 its reverse (211002221001012), we get a palindrome (421102343201124).
The spelling of 210100122200112 in words is "two hundred ten trillion, one hundred billion, one hundred twenty-two million, two hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •