Base | Representation |
---|---|
bin | 1001000110000101010100… |
… | …0000010011111010011011 |
3 | 1022102000000212020100012020 |
4 | 2101201111000103322123 |
5 | 2302320211130310021 |
6 | 33133553114545523 |
7 | 2051325022410222 |
oct | 221412500237233 |
9 | 38360025210166 |
10 | 10000110010011 |
11 | 3206028442190 |
12 | 11561087382a3 |
13 | 577010b952c4 |
14 | 2680179a7cb9 |
15 | 1251d49237c6 |
hex | 91855013e9b |
10000110010011 has 16 divisors (see below), whose sum is σ = 14545711757568. Its totient is φ = 6060632234400.
The previous prime is 10000110009971. The next prime is 10000110010109. The reversal of 10000110010011 is 11001001100001.
It is not a de Polignac number, because 10000110010011 - 29 = 10000110009499 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10000110010211) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 4438881 + ... + 6301101.
It is an arithmetic number, because the mean of its divisors is an integer number (909106984848).
Almost surely, 210000110010011 is an apocalyptic number.
10000110010011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10000110010011 is a deficient number, since it is larger than the sum of its proper divisors (4545601747557).
10000110010011 is a wasteful number, since it uses less digits than its factorization.
10000110010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2024962.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10000110010011 its reverse (11001001100001), we get a palindrome (21001111110012).
It can be divided in two parts, 10000 and 110010011, that added together give a palindrome (110020011).
The spelling of 10000110010011 in words is "ten trillion, one hundred ten million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •