Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …110010101110011011010011 |
3 | 111020121121020102111011011222 |
4 | 112331300200302232123103 |
5 | 101214300022240213021 |
6 | 554451115214155255 |
7 | 30163036651126154 |
oct | 2675604062563323 |
9 | 436547212434158 |
10 | 101001001101011 |
11 | 2a200314038080 |
12 | b3b2806ab2b2b |
13 | 4448479945b3b |
14 | 1ad26901b192b |
15 | ba2403d836ab |
hex | 5bdc20cae6d3 |
101001001101011 has 32 divisors (see below), whose sum is σ = 121745894745600. Its totient is φ = 82654366164480.
The previous prime is 101001001101001. The next prime is 101001001101031. The reversal of 101001001101011 is 110101100100101.
It is not a de Polignac number, because 101001001101011 - 242 = 96602954589907 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 101001001101011.
It is not an unprimeable number, because it can be changed into a prime (101001001101001) 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, 55966685 + ... + 57743153.
It is an arithmetic number, because the mean of its divisors is an integer number (3804559210800).
Almost surely, 2101001001101011 is an apocalyptic number.
101001001101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101001001101011 is a deficient number, since it is larger than the sum of its proper divisors (20744893644589).
101001001101011 is a wasteful number, since it uses less digits than its factorization.
101001001101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1789739.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101001001101011 its reverse (110101100100101), we get a palindrome (211102101201112).
The spelling of 101001001101011 in words is "one hundred one trillion, one billion, one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •