Base | Representation |
---|---|
bin | 10000001001110111001… |
… | …000001100101100010010 |
3 | 10221010100210101002201000 |
4 | 100021313020030230102 |
5 | 121141441122401320 |
6 | 2205550055522430 |
7 | 143126214004251 |
oct | 20116710145422 |
9 | 3833323332630 |
10 | 1110100200210 |
11 | 3988776939a1 |
12 | 15b18a389416 |
13 | 808b34793c1 |
14 | 3ba2ca70798 |
15 | 1dd22552c90 |
hex | 1027720cb12 |
1110100200210 has 32 divisors (see below), whose sum is σ = 2960267201280. Its totient is φ = 296026719984.
The previous prime is 1110100200149. The next prime is 1110100200239. The reversal of 1110100200210 is 120020010111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1110100200192 and 1110100200201.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2055740842 + ... + 2055741381.
It is an arithmetic number, because the mean of its divisors is an integer number (92508350040).
Almost surely, 21110100200210 is an apocalyptic number.
1110100200210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1110100200210 is an abundant number, since it is smaller than the sum of its proper divisors (1850167001070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110100200210 is a wasteful number, since it uses less digits than its factorization.
1110100200210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4111482239 (or 4111482233 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1110100200210 its reverse (120020010111), we get a palindrome (1230120210321).
The spelling of 1110100200210 in words is "one trillion, one hundred ten billion, one hundred million, two hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •