Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …1010110100111100100110 |
3 | 1022102002121121210110120000 |
4 | 2101202100222310330212 |
5 | 2302324233404323420 |
6 | 33134240313522130 |
7 | 2051361565650612 |
oct | 221422052647446 |
9 | 38362547713500 |
10 | 10001111011110 |
11 | 32064a148a11a |
12 | 1156347a13346 |
13 | 57714039304b |
14 | 2680b08d6342 |
15 | 125242751690 |
hex | 91890ab4f26 |
10001111011110 has 80 divisors (see below), whose sum is σ = 26901905182416. Its totient is φ = 2665968334272.
The previous prime is 10001111011097. The next prime is 10001111011159. The reversal of 10001111011110 is 1111011110001.
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 = 10001111011092 and 10001111011101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 127749 + ... + 4474208.
Almost surely, 210001111011110 is an apocalyptic number.
10001111011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10001111011110 is an abundant number, since it is smaller than the sum of its proper divisors (16900794171306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001111011110 is a wasteful number, since it uses less digits than its factorization.
10001111011110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4604659 (or 4604650 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10001111011110 its reverse (1111011110001), we get a palindrome (11112122121111).
The spelling of 10001111011110 in words is "ten trillion, one billion, one hundred eleven million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •