Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …0100001110000100000110 |
3 | 1022110001101210001022200200 |
4 | 2101223210010032010012 |
5 | 2303010213112023420 |
6 | 33143011430551330 |
7 | 2052164251624260 |
oct | 221534404160406 |
9 | 38401353038620 |
10 | 10011100111110 |
11 | 320a75802986a |
12 | 1158275208546 |
13 | 578072a350c7 |
14 | 26877b41cb30 |
15 | 1256296a9b90 |
hex | 91ae410e106 |
10011100111110 has 192 divisors, whose sum is σ = 31745121288192. Its totient is φ = 2136690275328.
The previous prime is 10011100111069. The next prime is 10011100111123. The reversal of 10011100111110 is 1111100111001.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10011100111092 and 10011100111101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2319922 + ... + 5040261.
It is an arithmetic number, because the mean of its divisors is an integer number (165339173376).
Almost surely, 210011100111110 is an apocalyptic number.
10011100111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10011100111110 is an abundant number, since it is smaller than the sum of its proper divisors (21734021177082).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011100111110 is a wasteful number, since it uses less digits than its factorization.
10011100111110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7360347 (or 7360344 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10011100111110 its reverse (1111100111001), we get a palindrome (11122200222111).
The spelling of 10011100111110 in words is "ten trillion, eleven billion, one hundred million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •