Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1001010010101111010 |
3 | 101111221002122010122100 |
4 | 1212130201022111322 |
5 | 3300240012334320 |
6 | 122311112204230 |
7 | 10642622413560 |
oct | 1463441122572 |
9 | 344832563570 |
10 | 110000121210 |
11 | 42718223191 |
12 | 1939a999676 |
13 | a4b0540125 |
14 | 5477215a30 |
15 | 2cdc11d790 |
hex | 199c84a57a |
110000121210 has 48 divisors (see below), whose sum is σ = 326857504896. Its totient is φ = 25142884704.
The previous prime is 110000121191. The next prime is 110000121221. The reversal of 110000121210 is 12121000011.
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 = 110000121192 and 110000121201.
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, 87301054 + ... + 87302313.
It is an arithmetic number, because the mean of its divisors is an integer number (6809531352).
Almost surely, 2110000121210 is an apocalyptic number.
110000121210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110000121210 is an abundant number, since it is smaller than the sum of its proper divisors (216857383686).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110000121210 is a wasteful number, since it uses less digits than its factorization.
110000121210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174603387 (or 174603384 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110000121210 its reverse (12121000011), we get a palindrome (122121121221).
It can be divided in two parts, 1100001 and 21210, that added together give a palindrome (1121211).
The spelling of 110000121210 in words is "one hundred ten billion, one hundred twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •