Base | Representation |
---|---|
bin | 1001001011111101001010… |
… | …0100111001100000110011 |
3 | 1022202122110010102201022121 |
4 | 2102333102210321200303 |
5 | 2310443322224013021 |
6 | 33252200311015111 |
7 | 2061526135603144 |
oct | 222772244714063 |
9 | 38678403381277 |
10 | 10101001001011 |
11 | 32448a0806a88 |
12 | 117178496a497 |
13 | 58369c16594b |
14 | 26cc690bbacb |
15 | 127b3beaa741 |
hex | 92fd2939833 |
10101001001011 has 2 divisors, whose sum is σ = 10101001001012. Its totient is φ = 10101001001010.
The previous prime is 10101001001009. The next prime is 10101001001017. The reversal of 10101001001011 is 11010010010101.
It is a happy number.
10101001001011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10101001001011 - 21 = 10101001001009 is a prime.
Together with 10101001001009, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10101001000985 and 10101001001003.
It is not a weakly prime, because it can be changed into another prime (10101001001017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050500500505 + 5050500500506.
It is an arithmetic number, because the mean of its divisors is an integer number (5050500500506).
Almost surely, 210101001001011 is an apocalyptic number.
10101001001011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101001001011 is an equidigital number, since it uses as much as digits as its factorization.
10101001001011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10101001001011 its reverse (11010010010101), we get a palindrome (21111011011112).
The spelling of 10101001001011 in words is "ten trillion, one hundred one billion, one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •