Base | Representation |
---|---|
bin | 1001001011111001110101… |
… | …1110011011000110000110 |
3 | 1022202120011001001211010100 |
4 | 2102332131132123012012 |
5 | 2310440011142023420 |
6 | 33251532044104530 |
7 | 2061465100266405 |
oct | 222763536330606 |
9 | 38676131054110 |
10 | 10100110111110 |
11 | 3244483937238 |
12 | 1171576535146 |
13 | 58358970ba66 |
14 | 26cbc2a5363c |
15 | 127ad8b7d190 |
hex | 92f9d79b186 |
10100110111110 has 96 divisors (see below), whose sum is σ = 27680121387360. Its totient is φ = 2548125402624.
The previous prime is 10100110111103. The next prime is 10100110111121. The reversal of 10100110111110 is 1111101100101.
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 = 10100110111092 and 10100110111101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2775559 + ... + 5282418.
It is an arithmetic number, because the mean of its divisors is an integer number (288334597785).
Almost surely, 210100110111110 is an apocalyptic number.
10100110111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10100110111110 is an abundant number, since it is smaller than the sum of its proper divisors (17580011276250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100110111110 is a wasteful number, since it uses less digits than its factorization.
10100110111110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8058742 (or 8058739 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10100110111110 its reverse (1111101100101), we get a palindrome (11211211211211).
The spelling of 10100110111110 in words is "ten trillion, one hundred billion, one hundred ten million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •