Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1101010110111000011101 |
3 | 1022102002100122121221022222 |
4 | 2101202022231112320131 |
5 | 2302324032304323401 |
6 | 33134222342315125 |
7 | 2051356242655445 |
oct | 221421255267035 |
9 | 38362318557288 |
10 | 10001011011101 |
11 | 320644aa98690 |
12 | 115631a428aa5 |
13 | 57712574c546 |
14 | 2680a1505125 |
15 | 125238a9bc1b |
hex | 9188ab56e1d |
10001011011101 has 32 divisors (see below), whose sum is σ = 11250689152896. Its totient is φ = 8813681280000.
The previous prime is 10001011011011. The next prime is 10001011011109. The reversal of 10001011011101 is 10111011010001.
It is not a de Polignac number, because 10001011011101 - 210 = 10001011010077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001011011109) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10661066 + ... + 11561156.
It is an arithmetic number, because the mean of its divisors is an integer number (351584036028).
Almost surely, 210001011011101 is an apocalyptic number.
10001011011101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10001011011101 is a deficient number, since it is larger than the sum of its proper divisors (1249678141795).
10001011011101 is a wasteful number, since it uses less digits than its factorization.
10001011011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 900413.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10001011011101 its reverse (10111011010001), we get a palindrome (20112022021102).
It can be divided in two parts, 100010 and 11011101, that added together give a palindrome (11111111).
The spelling of 10001011011101 in words is "ten trillion, one billion, eleven million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •