Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …0011101010110110000110 |
3 | 1022102221211210012010000000 |
4 | 2101222221003222312012 |
5 | 2303001201142023420 |
6 | 33142325303502130 |
7 | 2052130601023014 |
oct | 221525103526606 |
9 | 38387753163000 |
10 | 10010110111110 |
11 | 320a29a21614a |
12 | 1158039757946 |
13 | 577c458b97a5 |
14 | 2686c5b558b4 |
15 | 1255bc801690 |
hex | 91aa90ead86 |
10010110111110 has 64 divisors (see below), whose sum is σ = 27023177972160. Its totient is φ = 2669362690464.
The previous prime is 10010110111097. The next prime is 10010110111121. The reversal of 10010110111110 is 1111101101001.
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 = 10010110111092 and 10010110111101.
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, 228832957 + ... + 228876696.
It is an arithmetic number, because the mean of its divisors is an integer number (422237155815).
Almost surely, 210010110111110 is an apocalyptic number.
10010110111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10010110111110 is an abundant number, since it is smaller than the sum of its proper divisors (17013067861050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010110111110 is an frugal number, since it uses more digits than its factorization.
10010110111110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 457709681 (or 457709663 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10010110111110 its reverse (1111101101001), we get a palindrome (11121211212111).
The spelling of 10010110111110 in words is "ten trillion, ten billion, one hundred ten million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •