Base | Representation |
---|---|
bin | 11101011001010001100… |
… | …00110100101101011011 |
3 | 10120112222201110010110100 |
4 | 32230220300310231123 |
5 | 113021440301431021 |
6 | 2051553234550443 |
7 | 132653525365254 |
oct | 16545060645533 |
9 | 3515881403410 |
10 | 1010001202011 |
11 | 35a380390aaa |
12 | 1438b3438423 |
13 | 743202b7159 |
14 | 36c547ddb2b |
15 | 1b4147b0626 |
hex | eb28c34b5b |
1010001202011 has 6 divisors (see below), whose sum is σ = 1458890625140. Its totient is φ = 673334134668.
The previous prime is 1010001201991. The next prime is 1010001202027. The reversal of 1010001202011 is 1102021000101.
It is a happy number.
It is not a de Polignac number, because 1010001202011 - 221 = 1009999104859 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 112222355779 = 1010001202011 / (1 + 0 + 1 + 0 + 0 + 0 + 1 + 2 + 0 + 2 + 0 + 1 + 1).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010001201984 and 1010001202002.
It is not an unprimeable number, because it can be changed into a prime (1010001202051) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 56111177881 + ... + 56111177898.
Almost surely, 21010001202011 is an apocalyptic number.
1010001202011 is a deficient number, since it is larger than the sum of its proper divisors (448889423129).
1010001202011 is a wasteful number, since it uses less digits than its factorization.
1010001202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112222355785 (or 112222355782 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1010001202011 its reverse (1102021000101), we get a palindrome (2112022202112).
The spelling of 1010001202011 in words is "one trillion, ten billion, one million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •