Base | Representation |
---|---|
bin | 11101011101010111111… |
… | …00100101010111101101 |
3 | 10120202200002211100012021 |
4 | 32232223330211113231 |
5 | 113040442214201310 |
6 | 2052555455510141 |
7 | 133062211615132 |
oct | 16565374452755 |
9 | 3522602740167 |
10 | 1012202100205 |
11 | 3602aa77442a |
12 | 144208528351 |
13 | 745b127158a |
14 | 36dc2c32589 |
15 | 1b4e2b085da |
hex | ebabf255ed |
1012202100205 has 4 divisors (see below), whose sum is σ = 1214642520252. Its totient is φ = 809761680160.
The previous prime is 1012202100167. The next prime is 1012202100229. The reversal of 1012202100205 is 5020012022101.
It is a happy number.
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 493368569604 + 518833530601 = 702402^2 + 720301^2 .
It is not a de Polignac number, because 1012202100205 - 239 = 462446286317 is a prime.
It is a super-2 number, since 2×10122021002052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101220210016 + ... + 101220210025.
It is an arithmetic number, because the mean of its divisors is an integer number (303660630063).
Almost surely, 21012202100205 is an apocalyptic number.
It is an amenable number.
1012202100205 is a deficient number, since it is larger than the sum of its proper divisors (202440420047).
1012202100205 is an equidigital number, since it uses as much as digits as its factorization.
1012202100205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202440420046.
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 1012202100205 its reverse (5020012022101), we get a palindrome (6032214122306).
The spelling of 1012202100205 in words is "one trillion, twelve billion, two hundred two million, one hundred thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •