Base | Representation |
---|---|
bin | 1001000110101110010101… |
… | …0011111110110011001110 |
3 | 1022110001110020101121110002 |
4 | 2101223211103332303032 |
5 | 2303010233440120420 |
6 | 33143013455044302 |
7 | 2052164624430410 |
oct | 221534523766316 |
9 | 38401406347402 |
10 | 10011121020110 |
11 | 320a768910031 |
12 | 1158280210692 |
13 | 5780771761b2 |
14 | 2687801029b0 |
15 | 12562b43a075 |
hex | 91ae54fecce |
10011121020110 has 64 divisors (see below), whose sum is σ = 20944626762240. Its totient is φ = 3374004600960.
The previous prime is 10011121020091. The next prime is 10011121020127. The reversal of 10011121020110 is 1102012111001.
It is a junction number, because it is equal to n+sod(n) for n = 10011121020091 and 10011121020100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 78559145 + ... + 78686475.
It is an arithmetic number, because the mean of its divisors is an integer number (327259793160).
Almost surely, 210011121020110 is an apocalyptic number.
10011121020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10011121020110 is an abundant number, since it is smaller than the sum of its proper divisors (10933505742130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011121020110 is a wasteful number, since it uses less digits than its factorization.
10011121020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146441.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10011121020110 its reverse (1102012111001), we get a palindrome (11113133131111).
It can be divided in two parts, 10011 and 121020110, that added together give a palindrome (121030121).
The spelling of 10011121020110 in words is "ten trillion, eleven billion, one hundred twenty-one million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •