Base | Representation |
---|---|
bin | 11101011001011110100… |
… | …11101011010110011011 |
3 | 10120120021101001112202000 |
4 | 32230233103223112123 |
5 | 113022201404031021 |
6 | 2052012200212043 |
7 | 132656330565006 |
oct | 16545723532633 |
9 | 3516241045660 |
10 | 1010111002011 |
11 | 35a427366401 |
12 | 14392416a023 |
13 | 74339c7c477 |
14 | 36c6522253d |
15 | 1b41e24db26 |
hex | eb2f4eb59b |
1010111002011 has 8 divisors (see below), whose sum is σ = 1496460743760. Its totient is φ = 673407334656.
The previous prime is 1010111001989. The next prime is 1010111002039. The reversal of 1010111002011 is 1102001110101.
It is not a de Polignac number, because 1010111002011 - 27 = 1010111001883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1010111001984 and 1010111002002.
It is not an unprimeable number, because it can be changed into a prime (1010111002211) 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, 18705759270 + ... + 18705759323.
It is an arithmetic number, because the mean of its divisors is an integer number (187057592970).
Almost surely, 21010111002011 is an apocalyptic number.
1010111002011 is a deficient number, since it is larger than the sum of its proper divisors (486349741749).
1010111002011 is an equidigital number, since it uses as much as digits as its factorization.
1010111002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37411518602 (or 37411518596 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1010111002011 its reverse (1102001110101), we get a palindrome (2112112112112).
The spelling of 1010111002011 in words is "one trillion, ten billion, one hundred eleven million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •