Base | Representation |
---|---|
bin | 11101011001101001001… |
… | …11100100010011011110 |
3 | 10120120111120201022002200 |
4 | 32230310213210103132 |
5 | 113022342211231420 |
6 | 2052025102032330 |
7 | 132661462122033 |
oct | 16546447442336 |
9 | 3516446638080 |
10 | 1010200102110 |
11 | 35a472692651 |
12 | 143949b786a6 |
13 | 74352577914 |
14 | 36c72db738a |
15 | 1b426e9db90 |
hex | eb349e44de |
1010200102110 has 48 divisors (see below), whose sum is σ = 2740716804384. Its totient is φ = 257674228416.
The previous prime is 1010200102097. The next prime is 1010200102159. The reversal of 1010200102110 is 112010020101.
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 = 1010200102092 and 1010200102101.
It is a congruent number.
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, 244007617 + ... + 244011756.
It is an arithmetic number, because the mean of its divisors is an integer number (57098266758).
Almost surely, 21010200102110 is an apocalyptic number.
1010200102110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010200102110 is an abundant number, since it is smaller than the sum of its proper divisors (1730516702274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010200102110 is a wasteful number, since it uses less digits than its factorization.
1010200102110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 488019409 (or 488019406 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1010200102110 its reverse (112010020101), we get a palindrome (1122210122211).
The spelling of 1010200102110 in words is "one trillion, ten billion, two hundred million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •