Base | Representation |
---|---|
bin | 110011010111011111… |
… | …1110000000110111110 |
3 | 101112201200222012220110 |
4 | 1212232333300012332 |
5 | 3301403343130420 |
6 | 122401544530450 |
7 | 10653405430605 |
oct | 1465677600676 |
9 | 345650865813 |
10 | 110310130110 |
11 | 42867213494 |
12 | 19466780a26 |
13 | a52c83384b |
14 | 54a6472a3c |
15 | 2d09457ee0 |
hex | 19aeff01be |
110310130110 has 32 divisors (see below), whose sum is σ = 273873428640. Its totient is φ = 28401688448.
The previous prime is 110310130037. The next prime is 110310130121. The reversal of 110310130110 is 11031013011.
It is a super-2 number, since 2×1103101301102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63395757 + ... + 63397496.
It is an arithmetic number, because the mean of its divisors is an integer number (8558544645).
Almost surely, 2110310130110 is an apocalyptic number.
110310130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110310130110 is an abundant number, since it is smaller than the sum of its proper divisors (163563298530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110310130110 is a wasteful number, since it uses less digits than its factorization.
110310130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126793292.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 110310130110 its reverse (11031013011), we get a palindrome (121341143121).
The spelling of 110310130110 in words is "one hundred ten billion, three hundred ten million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •