Base | Representation |
---|---|
bin | 11101011011001001110… |
… | …01110110100111110101 |
3 | 10120122121001001122101001 |
4 | 32231210321312213311 |
5 | 113031022102431401 |
6 | 2052241321203301 |
7 | 133020526632424 |
oct | 16554471664765 |
9 | 3518531048331 |
10 | 1011010202101 |
11 | 35a8489a1779 |
12 | 143b35330531 |
13 | 74451355a23 |
14 | 36d0c8112bb |
15 | 1b47316d601 |
hex | eb64e769f5 |
1011010202101 has 4 divisors (see below), whose sum is σ = 1021020204204. Its totient is φ = 1001000200000.
The previous prime is 1011010202077. The next prime is 1011010202117. The reversal of 1011010202101 is 1012020101101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 971269380900 + 39740821201 = 985530^2 + 199351^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011010202101 - 29 = 1011010201589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011010202401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5005000900 + ... + 5005001101.
It is an arithmetic number, because the mean of its divisors is an integer number (255255051051).
Almost surely, 21011010202101 is an apocalyptic number.
It is an amenable number.
1011010202101 is a deficient number, since it is larger than the sum of its proper divisors (10010002103).
1011010202101 is a wasteful number, since it uses less digits than its factorization.
1011010202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10010002102.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1011010202101 its reverse (1012020101101), we get a palindrome (2023030303202).
The spelling of 1011010202101 in words is "one trillion, eleven billion, ten million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •