Base | Representation |
---|---|
bin | 1001001100000000111000… |
… | …1000001100101010000010 |
3 | 1022202202000202102201111000 |
4 | 2103000032020030222002 |
5 | 2311002344012011320 |
6 | 33252443401232430 |
7 | 2061562660104021 |
oct | 223001610145202 |
9 | 38682022381430 |
10 | 10102000110210 |
11 | 3245263781568 |
12 | 1171a03492716 |
13 | 5837cb150518 |
14 | 26cd21a768b8 |
15 | 127b99a62c90 |
hex | 9300e20ca82 |
10102000110210 has 64 divisors (see below), whose sum is σ = 26993532216960. Its totient is φ = 2688380170560.
The previous prime is 10102000110199. The next prime is 10102000110227. The reversal of 10102000110210 is 1201100020101.
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 = 10102000110192 and 10102000110201.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37968057 + ... + 38233196.
It is an arithmetic number, because the mean of its divisors is an integer number (421773940890).
Almost surely, 210102000110210 is an apocalyptic number.
10102000110210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10102000110210 is an abundant number, since it is smaller than the sum of its proper divisors (16891532106750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102000110210 is a wasteful number, since it uses less digits than its factorization.
10102000110210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76201760 (or 76201754 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10102000110210 its reverse (1201100020101), we get a palindrome (11303100130311).
The spelling of 10102000110210 in words is "ten trillion, one hundred two billion, one hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •