Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …0111011110101111011110 |
3 | 1022102221211212001212101000 |
4 | 2101222221013132233132 |
5 | 2303001201421010420 |
6 | 33142325341131130 |
7 | 2052130612353366 |
oct | 221525107365736 |
9 | 38387755055330 |
10 | 10010111110110 |
11 | 320a29a838771 |
12 | 1158039b59aa6 |
13 | 577c45b79407 |
14 | 2686c5d359a6 |
15 | 1255bc94c690 |
hex | 91aa91debde |
10010111110110 has 64 divisors (see below), whose sum is σ = 26810195860800. Its totient is φ = 2657706339456.
The previous prime is 10010111110039. The next prime is 10010111110169. The reversal of 10010111110110 is 1101111101001.
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 = 10010111110092 and 10010111110101.
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, 80886829 + ... + 81010488.
It is an arithmetic number, because the mean of its divisors is an integer number (418909310325).
Almost surely, 210010111110110 is an apocalyptic number.
10010111110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10010111110110 is an abundant number, since it is smaller than the sum of its proper divisors (16800084750690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010111110110 is a wasteful number, since it uses less digits than its factorization.
10010111110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161897562 (or 161897556 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10010111110110 its reverse (1101111101001), we get a palindrome (11111222211111).
The spelling of 10010111110110 in words is "ten trillion, ten billion, one hundred eleven million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •