Base | Representation |
---|---|
bin | 101111000101100111… |
… | …0001110101101100110 |
3 | 100200000020010210122200 |
4 | 1132023032032231212 |
5 | 3124043210323420 |
6 | 114242012435330 |
7 | 10206563625006 |
oct | 1361316165546 |
9 | 320006123580 |
10 | 101120011110 |
11 | 39980679018 |
12 | 17720a78b46 |
13 | 96c6878901 |
14 | 4c73acc006 |
15 | 296c724b90 |
hex | 178b38eb66 |
101120011110 has 48 divisors (see below), whose sum is σ = 263218297680. Its totient is φ = 26933924160.
The previous prime is 101120011067. The next prime is 101120011151. The reversal of 101120011110 is 11110021101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101120011092 and 101120011101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 576681 + ... + 731300.
It is an arithmetic number, because the mean of its divisors is an integer number (5483714535).
Almost surely, 2101120011110 is an apocalyptic number.
101120011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101120011110 is an abundant number, since it is smaller than the sum of its proper divisors (162098286570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120011110 is a wasteful number, since it uses less digits than its factorization.
101120011110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1308853 (or 1308850 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101120011110 its reverse (11110021101), we get a palindrome (112230032211).
Subtracting from 101120011110 its reverse (11110021101), we obtain a palindrome (90009990009).
The spelling of 101120011110 in words is "one hundred one billion, one hundred twenty million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.257 sec. • engine limits •