Base | Representation |
---|---|
bin | 11101101100010001100… |
… | …01110010011001011100 |
3 | 10121112022122001110101210 |
4 | 32312020301302121130 |
5 | 113203333203031022 |
6 | 2100401353304420 |
7 | 133464361636044 |
oct | 16661061623134 |
9 | 3545278043353 |
10 | 1020202002012 |
11 | 363735485026 |
12 | 14587b705110 |
13 | 7528777ba9b |
14 | 375414b2724 |
15 | 1b8100d4a0c |
hex | ed88c7265c |
1020202002012 has 48 divisors (see below), whose sum is σ = 2385397469952. Its totient is φ = 339363809280.
The previous prime is 1020202001993. The next prime is 1020202002023. The reversal of 1020202002012 is 2102002020201.
1020202002012 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76315753 + ... + 76329119.
It is an arithmetic number, because the mean of its divisors is an integer number (49695780624).
Almost surely, 21020202002012 is an apocalyptic number.
1020202002012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1020202002012 is an abundant number, since it is smaller than the sum of its proper divisors (1365195467940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020202002012 is a wasteful number, since it uses less digits than its factorization.
1020202002012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26058 (or 26056 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 1020202002012 its reverse (2102002020201), we get a palindrome (3122204022213).
The spelling of 1020202002012 in words is "one trillion, twenty billion, two hundred two million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •