Base | Representation |
---|---|
bin | 10000001010101101010… |
… | …111100101000110100100 |
3 | 10221012201012200222111202 |
4 | 100022231113211012210 |
5 | 121200322102431040 |
6 | 2210220244222032 |
7 | 143160603620615 |
oct | 20125527450644 |
9 | 3835635628452 |
10 | 1111010202020 |
11 | 3991a4327804 |
12 | 15b3a309a918 |
13 | 809c9b65404 |
14 | 3bab7871c0c |
15 | 1dd773a8015 |
hex | 102ad5e51a4 |
1111010202020 has 24 divisors (see below), whose sum is σ = 2334225687864. Its totient is φ = 444193744896.
The previous prime is 1111010202019. The next prime is 1111010202047. The reversal of 1111010202020 is 202020101111.
It can be written as a sum of positive squares in 4 ways, for example, as 10995200164 + 1100015001856 = 104858^2 + 1048816^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1111010201992 and 1111010202010.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13102679 + ... + 13187198.
It is an arithmetic number, because the mean of its divisors is an integer number (97259403661).
Almost surely, 21111010202020 is an apocalyptic number.
1111010202020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111010202020 is an abundant number, since it is smaller than the sum of its proper divisors (1223215485844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111010202020 is a wasteful number, since it uses less digits than its factorization.
1111010202020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26291999 (or 26291997 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1111010202020 its reverse (202020101111), we get a palindrome (1313030303131).
The spelling of 1111010202020 in words is "one trillion, one hundred eleven billion, ten million, two hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •