Base | Representation |
---|---|
bin | 11101000110110110011… |
… | …00111000101101110011 |
3 | 10112121110101102001111120 |
4 | 32203123030320231303 |
5 | 112341211130013021 |
6 | 2043235540113323 |
7 | 132153441513462 |
oct | 16433314705563 |
9 | 3477411361446 |
10 | 1000110001011 |
11 | 356165028320 |
12 | 1419b2995843 |
13 | 734050014b4 |
14 | 36596cbc9d9 |
15 | 1b0362442c6 |
hex | e8db338b73 |
1000110001011 has 32 divisors (see below), whose sum is σ = 1508118635520. Its totient is φ = 583962086400.
The previous prime is 1000110001001. The next prime is 1000110001021. The reversal of 1000110001011 is 1101000110001.
It is an interprime number because it is at equal distance from previous prime (1000110001001) and next prime (1000110001021).
It is not a de Polignac number, because 1000110001011 - 25 = 1000110000979 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1000110001001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 685470 + ... + 1571651.
It is an arithmetic number, because the mean of its divisors is an integer number (47128707360).
Almost surely, 21000110001011 is an apocalyptic number.
1000110001011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1000110001011 is a deficient number, since it is larger than the sum of its proper divisors (508008634509).
1000110001011 is a wasteful number, since it uses less digits than its factorization.
1000110001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2257627.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1000110001011 its reverse (1101000110001), we get a palindrome (2101110111012).
The spelling of 1000110001011 in words is "one trillion, one hundred ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •