Base | Representation |
---|---|
bin | 10110111101110000100110… |
… | …101111110100000100110011 |
3 | 111020121121111101110121012222 |
4 | 112331300212233310010303 |
5 | 101214300223324013021 |
6 | 554451133143311255 |
7 | 30163042303223621 |
oct | 2675604657640463 |
9 | 436547441417188 |
10 | 101001101001011 |
11 | 2a200365470462 |
12 | b3b283444b52b |
13 | 4448494552c73 |
14 | 1ad269d578511 |
15 | ba240ca186ab |
hex | 5bdc26bf4133 |
101001101001011 has 8 divisors (see below), whose sum is σ = 103350642744624. Its totient is φ = 98651590117920.
The previous prime is 101001101000977. The next prime is 101001101001023. The reversal of 101001101001011 is 110100101100101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101001101001011 - 210 = 101001100999987 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 101001101001011.
It is not an unprimeable number, because it can be changed into a prime (101001109001011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1026680 + ... + 14249781.
It is an arithmetic number, because the mean of its divisors is an integer number (12918830343078).
Almost surely, 2101001101001011 is an apocalyptic number.
101001101001011 is a deficient number, since it is larger than the sum of its proper divisors (2349541743613).
101001101001011 is a wasteful number, since it uses less digits than its factorization.
101001101001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15430261.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101001101001011 its reverse (110100101100101), we get a palindrome (211101202101112).
The spelling of 101001101001011 in words is "one hundred one trillion, one billion, one hundred one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •