Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …101110010111000100010011 |
3 | 111020121111200100202010202021 |
4 | 112331233211232113010103 |
5 | 101214241010041213021 |
6 | 554450433013432311 |
7 | 30163003255561300 |
oct | 2675574556270423 |
9 | 436544610663667 |
10 | 101000010101011 |
11 | 2a1aa95570110a |
12 | b3b258b03b697 |
13 | 444834c53a2c8 |
14 | 1ad25d87280a7 |
15 | ba2396d7dc41 |
hex | 5bdbe5b97113 |
101000010101011 has 12 divisors (see below), whose sum is σ = 117490025583000. Its totient is φ = 86571276660960.
The previous prime is 101000010100967. The next prime is 101000010101017. The reversal of 101000010101011 is 110101010000101.
It is a happy number.
It is not a de Polignac number, because 101000010101011 - 213 = 101000010092819 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 101000010100985 and 101000010101003.
It is not an unprimeable number, because it can be changed into a prime (101000010101017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30238671 + ... + 33412231.
It is an arithmetic number, because the mean of its divisors is an integer number (9790835465250).
Almost surely, 2101000010101011 is an apocalyptic number.
101000010101011 is a deficient number, since it is larger than the sum of its proper divisors (16490015481989).
101000010101011 is an equidigital number, since it uses as much as digits as its factorization.
101000010101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3823074 (or 3823067 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101000010101011 its reverse (110101010000101), we get a palindrome (211101020101112).
The spelling of 101000010101011 in words is "one hundred one trillion, ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •