Base | Representation |
---|---|
bin | 11101011001010010101… |
… | …10100101011101010011 |
3 | 10120120000102002001022222 |
4 | 32230221112211131103 |
5 | 113022000320213021 |
6 | 2051554231051255 |
7 | 132654005464313 |
oct | 16545126453523 |
9 | 3516012061288 |
10 | 1010011101011 |
11 | 35a385a322a0 |
12 | 1438b6810b2b |
13 | 74322371a53 |
14 | 36c55c59443 |
15 | 1b4155b86ab |
hex | eb295a5753 |
1010011101011 has 32 divisors (see below), whose sum is σ = 1136228458176. Its totient is φ = 890092800000.
The previous prime is 1010011101007. The next prime is 1010011101017. The reversal of 1010011101011 is 1101011100101.
It is not a de Polignac number, because 1010011101011 - 22 = 1010011101007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1010011101011.
It is not an unprimeable number, because it can be changed into a prime (1010011101017) 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, 11065661 + ... + 11156561.
It is an arithmetic number, because the mean of its divisors is an integer number (35507139318).
Almost surely, 21010011101011 is an apocalyptic number.
1010011101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1010011101011 is a deficient number, since it is larger than the sum of its proper divisors (126217357165).
1010011101011 is a wasteful number, since it uses less digits than its factorization.
1010011101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91223.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 1010011101011 its reverse (1101011100101), we get a palindrome (2111022201112).
It can be divided in two parts, 10100 and 11101011, that added together give a palindrome (11111111).
The spelling of 1010011101011 in words is "one trillion, ten billion, eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •