Base | Representation |
---|---|
bin | 101110100100100101… |
… | …1111011000110000010 |
3 | 100120011000102121100000 |
4 | 1131021023323012002 |
5 | 3114311100011320 |
6 | 113540034340430 |
7 | 10140251624145 |
oct | 1351113730602 |
9 | 316130377300 |
10 | 100012110210 |
11 | 39462257741 |
12 | 17471a2a716 |
13 | 957b18c94c |
14 | 4baa8d405c |
15 | 290532cc90 |
hex | 17492fb182 |
100012110210 has 48 divisors (see below), whose sum is σ = 269662288896. Its totient is φ = 26669895408.
The previous prime is 100012110203. The next prime is 100012110227. The reversal of 100012110210 is 12011210001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100012110192 and 100012110201.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20576194 + ... + 20581053.
It is an arithmetic number, because the mean of its divisors is an integer number (5617964352).
Almost surely, 2100012110210 is an apocalyptic number.
100012110210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100012110210 is an abundant number, since it is smaller than the sum of its proper divisors (169650178686).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100012110210 is an equidigital number, since it uses as much as digits as its factorization.
100012110210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41157269 (or 41157257 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100012110210 its reverse (12011210001), we get a palindrome (112023320211).
It can be divided in two parts, 1000121 and 10210, that added together give a triangular number (1010331 = T1421).
The spelling of 100012110210 in words is "one hundred billion, twelve million, one hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •