Base | Representation |
---|---|
bin | 1001001011111001110110… |
… | …0001110110100011011011 |
3 | 1022202120011002202111011222 |
4 | 2102332131201312203123 |
5 | 2310440011404310021 |
6 | 33251532115242255 |
7 | 2061465111032201 |
oct | 222763541664333 |
9 | 38676132674158 |
10 | 10100111010011 |
11 | 32444843a0630 |
12 | 11715768a938b |
13 | 583589964c59 |
14 | 26cbc2c09071 |
15 | 127ad8ca96ab |
hex | 92f9d8768db |
10100111010011 has 24 divisors (see below), whose sum is σ = 11396042766144. Its totient is φ = 8877263850000.
The previous prime is 10100111009999. The next prime is 10100111010083. The reversal of 10100111010011 is 11001011100101.
It is a de Polignac number, because none of the positive numbers 2k-10100111010011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10100111010611) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10655576 + ... + 11564666.
It is an arithmetic number, because the mean of its divisors is an integer number (474835115256).
Almost surely, 210100111010011 is an apocalyptic number.
10100111010011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10100111010011 is a deficient number, since it is larger than the sum of its proper divisors (1295931756133).
10100111010011 is a wasteful number, since it uses less digits than its factorization.
10100111010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 910215 (or 910184 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10100111010011 its reverse (11001011100101), we get a palindrome (21101122110112).
It can be divided in two parts, 10100 and 111010011, that added together give a palindrome (111020111).
The spelling of 10100111010011 in words is "ten trillion, one hundred billion, one hundred eleven million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.216 sec. • engine limits •