Base | Representation |
---|---|
bin | 10010110100000010… |
… | …01101001010101110 |
3 | 222001220022022211120 |
4 | 21122001031022232 |
5 | 131141122400420 |
6 | 4350122201410 |
7 | 505202166360 |
oct | 113201151256 |
9 | 28056268746 |
10 | 10100200110 |
11 | 4313332920 |
12 | 1b5a653266 |
13 | c4c6a1090 |
14 | 6bb5a6d30 |
15 | 3e1aa1d40 |
hex | 25a04d2ae |
10100200110 has 256 divisors, whose sum is σ = 32680101888. Its totient is φ = 1929369600.
The previous prime is 10100200093. The next prime is 10100200129. The reversal of 10100200110 is 1100200101.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a congruent 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, 9518980 + ... + 9520040.
It is an arithmetic number, because the mean of its divisors is an integer number (127656648).
Almost surely, 210100200110 is an apocalyptic number.
10100200110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10100200110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16340050944).
10100200110 is an abundant number, since it is smaller than the sum of its proper divisors (22579901778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100200110 is a wasteful number, since it uses less digits than its factorization.
10100200110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1419.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 10100200110 its reverse (1100200101), we get a palindrome (11200400211).
Subtracting from 10100200110 its reverse (1100200101), we obtain a palindrome (9000000009).
The spelling of 10100200110 in words is "ten billion, one hundred million, two hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •