Base | Representation |
---|---|
bin | 11101011001011110101… |
… | …00000101101111100000 |
3 | 10120120021101021001000202 |
4 | 32230233110011233200 |
5 | 113022201421010422 |
6 | 2052012202404332 |
7 | 132656331525116 |
oct | 16545724055740 |
9 | 3516241231022 |
10 | 1010111110112 |
11 | 35a42742a645 |
12 | 1439242006a8 |
13 | 74339cb9730 |
14 | 36c6524dab6 |
15 | 1b41e270b92 |
hex | eb2f505be0 |
1010111110112 has 48 divisors (see below), whose sum is σ = 2154009322080. Its totient is φ = 463510267392.
The previous prime is 1010111110111. The next prime is 1010111110117. The reversal of 1010111110112 is 2110111110101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1010111110093 and 1010111110102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010111110111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6945812 + ... + 7089747.
It is an arithmetic number, because the mean of its divisors is an integer number (44875194210).
Almost surely, 21010111110112 is an apocalyptic number.
It is an amenable number.
1010111110112 is an abundant number, since it is smaller than the sum of its proper divisors (1143898211968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010111110112 is a wasteful number, since it uses less digits than its factorization.
1010111110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14035755 (or 14035747 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Subtracting from 1010111110112 its sum of digits (11), we obtain a palindrome (1010111110101).
Adding to 1010111110112 its reverse (2110111110101), we get a palindrome (3120222220213).
The spelling of 1010111110112 in words is "one trillion, ten billion, one hundred eleven million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •