Base | Representation |
---|---|
bin | 1001001100100110001011… |
… | …0101001000011011011110 |
3 | 1022210200212102220012122002 |
4 | 2103021202311020123132 |
5 | 2311133344321010420 |
6 | 33301221015522302 |
7 | 2062366030151450 |
oct | 223114265103336 |
9 | 38720772805562 |
10 | 10112011110110 |
11 | 32495307199a8 |
12 | 1173938089392 |
13 | 5847351bc6c0 |
14 | 26d5d14602d0 |
15 | 128083895075 |
hex | 93262d486de |
10112011110110 has 64 divisors (see below), whose sum is σ = 22611358490112. Its totient is φ = 3170375600256.
The previous prime is 10112011110109. The next prime is 10112011110199. The reversal of 10112011110110 is 1101111021101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10112011110091 and 10112011110100.
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, 51828332 + ... + 52023071.
It is an arithmetic number, because the mean of its divisors is an integer number (353302476408).
Almost surely, 210112011110110 is an apocalyptic number.
10112011110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10112011110110 is an abundant number, since it is smaller than the sum of its proper divisors (12499347380002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112011110110 is a wasteful number, since it uses less digits than its factorization.
10112011110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103851537.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 10112011110110 its reverse (1101111021101), we get a palindrome (11213122131211).
The spelling of 10112011110110 in words is "ten trillion, one hundred twelve billion, eleven million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •