Base | Representation |
---|---|
bin | 10110111111010110000001… |
… | …101000111010011010010011 |
3 | 111021000000120202100001200222 |
4 | 112333112001220322122103 |
5 | 101223041240011213021 |
6 | 555013143125103255 |
7 | 30203646026262236 |
oct | 2677260150723223 |
9 | 437000522301628 |
10 | 101110000101011 |
11 | 2a242568141060 |
12 | b40b966557b2b |
13 | 445582a945645 |
14 | 1ad7a7046741d |
15 | ba518314d6ab |
hex | 5bf581a3a693 |
101110000101011 has 16 divisors (see below), whose sum is σ = 111709479436128. Its totient is φ = 90750287232000.
The previous prime is 101110000101001. The next prime is 101110000101013. The reversal of 101110000101011 is 110101000011101.
It is a de Polignac number, because none of the positive numbers 2k-101110000101011 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 101110000101011.
It is not an unprimeable number, because it can be changed into a prime (101110000101013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 128514476 + ... + 129298841.
It is an arithmetic number, because the mean of its divisors is an integer number (6981842464758).
Almost surely, 2101110000101011 is an apocalyptic number.
101110000101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101110000101011 is a deficient number, since it is larger than the sum of its proper divisors (10599479335117).
101110000101011 is a wasteful number, since it uses less digits than its factorization.
101110000101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257813782.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101110000101011 its reverse (110101000011101), we get a palindrome (211211000112112).
The spelling of 101110000101011 in words is "one hundred one trillion, one hundred ten billion, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •