Base | Representation |
---|---|
bin | 11001000010001010101110… |
… | …100110100100000000100010 |
3 | 112102211110122201220002011102 |
4 | 121002022232212210000202 |
5 | 103412340021434311320 |
6 | 1030055144120314402 |
7 | 32122320431204522 |
oct | 3102125646440042 |
9 | 472743581802142 |
10 | 110100121010210 |
11 | 32099221008031 |
12 | 10422183912a02 |
13 | 4958520b9c876 |
14 | 1d28c350a1682 |
15 | cade543a2175 |
hex | 6422ae9a4022 |
110100121010210 has 32 divisors (see below), whose sum is σ = 202824950087232. Its totient is φ = 43008248203200.
The previous prime is 110100121010203. The next prime is 110100121010237. The reversal of 110100121010210 is 12010121001011.
It is a junction number, because it is equal to n+sod(n) for n = 110100121010191 and 110100121010200.
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 15 ways as a sum of consecutive naturals, for example, 20225069 + ... + 25084928.
It is an arithmetic number, because the mean of its divisors is an integer number (6338279690226).
Almost surely, 2110100121010210 is an apocalyptic number.
110100121010210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110100121010210 is a deficient number, since it is larger than the sum of its proper divisors (92724829077022).
110100121010210 is a wasteful number, since it uses less digits than its factorization.
110100121010210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45315698.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110100121010210 its reverse (12010121001011), we get a palindrome (122110242011221).
The spelling of 110100121010210 in words is "one hundred ten trillion, one hundred billion, one hundred twenty-one million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •