Base | Representation |
---|---|
bin | 1001001101001011011001… |
… | …0001111101110010010010 |
3 | 1022211122122122211220012212 |
4 | 2103102312101331302102 |
5 | 2311314324241042320 |
6 | 33305552204152122 |
7 | 2063201423603141 |
oct | 223226621756222 |
9 | 38748578756185 |
10 | 10122001112210 |
11 | 3252797825389 |
12 | 1175865838642 |
13 | 585667ab9250 |
14 | 26dc9c13d758 |
15 | 12846a92a9c5 |
hex | 934b647dc92 |
10122001112210 has 256 divisors, whose sum is σ = 21702639329280. Its totient is φ = 3363341598720.
The previous prime is 10122001112191. The next prime is 10122001112231. The reversal of 10122001112210 is 1221110022101.
10122001112210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101220011122102 (a number of 27 digits) contains 22 as substring.
It is a Curzon 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, 6492623411 + ... + 6492624969.
It is an arithmetic number, because the mean of its divisors is an integer number (84775934880).
Almost surely, 210122001112210 is an apocalyptic number.
10122001112210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10122001112210 is an abundant number, since it is smaller than the sum of its proper divisors (11580638217070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122001112210 is a wasteful number, since it uses less digits than its factorization.
10122001112210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2701.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10122001112210 its reverse (1221110022101), we get a palindrome (11343111134311).
The spelling of 10122001112210 in words is "ten trillion, one hundred twenty-two billion, one million, one hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •