Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1100101100100001110 |
3 | 100200020111111201210100 |
4 | 1132100211211210032 |
5 | 3124234231120420 |
6 | 114254545551530 |
7 | 10212035655633 |
oct | 1362045454416 |
9 | 320214451710 |
10 | 101210020110 |
11 | 39a17466121 |
12 | 177470455a6 |
13 | 970c401984 |
14 | 4c81a3c18a |
15 | 29755a4190 |
hex | 179096590e |
101210020110 has 48 divisors (see below), whose sum is σ = 263171463984. Its totient is φ = 26986732416.
The previous prime is 101210020103. The next prime is 101210020123. The reversal of 101210020110 is 11020012101.
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 = 101210020092 and 101210020101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 994869 + ... + 1091871.
It is an arithmetic number, because the mean of its divisors is an integer number (5482738833).
Almost surely, 2101210020110 is an apocalyptic number.
101210020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101210020110 is an abundant number, since it is smaller than the sum of its proper divisors (161961443874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101210020110 is a wasteful number, since it uses less digits than its factorization.
101210020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108609 (or 108606 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101210020110 its reverse (11020012101), we get a palindrome (112230032211).
The spelling of 101210020110 in words is "one hundred one billion, two hundred ten million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •