Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …1011101011110010000100 |
3 | 1022102221211221010212000110 |
4 | 2101222221023223302010 |
5 | 2303001202211241400 |
6 | 33142325420513020 |
7 | 2052130624623240 |
oct | 221525113536204 |
9 | 38387757125013 |
10 | 10010112212100 |
11 | 320a2a0420700 |
12 | 115803a3ab770 |
13 | 577c46173b90 |
14 | 2686c6141420 |
15 | 1255bcab8e50 |
hex | 91aa92ebc84 |
10010112212100 has 864 divisors, whose sum is σ = 40240882140928. Its totient is φ = 1868106240000.
The previous prime is 10010112212041. The next prime is 10010112212123. The reversal of 10010112212100 is 121221101001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 122181150 + ... + 122263050.
Almost surely, 210010112212100 is an apocalyptic number.
10010112212100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10010112212100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20120441070464).
10010112212100 is an abundant number, since it is smaller than the sum of its proper divisors (30230769928828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010112212100 is a wasteful number, since it uses less digits than its factorization.
10010112212100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81997 (or 81979 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10010112212100 its reverse (121221101001), we get a palindrome (10131333313101).
The spelling of 10010112212100 in words is "ten trillion, ten billion, one hundred twelve million, two hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •