Base | Representation |
---|---|
bin | 11101101111101010100… |
… | …00111010110000000100 |
3 | 10121201000110220010020012 |
4 | 32313311100322300010 |
5 | 113221100124231040 |
6 | 2101302132325352 |
7 | 133560442350053 |
oct | 16676520726004 |
9 | 3551013803205 |
10 | 1022022102020 |
11 | 364489918107 |
12 | 1460a9173858 |
13 | 754b788893a |
14 | 376750dc39a |
15 | 1b8b9cad865 |
hex | edf543ac04 |
1022022102020 has 48 divisors (see below), whose sum is σ = 2150143422336. Its totient is φ = 408067104000.
The previous prime is 1022022101999. The next prime is 1022022102067. The reversal of 1022022102020 is 202012202201.
1022022102020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 1022022101986 and 1022022102004.
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, 32418065 + ... + 32449575.
It is an arithmetic number, because the mean of its divisors is an integer number (44794654632).
Almost surely, 21022022102020 is an apocalyptic number.
1022022102020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022022102020 is an abundant number, since it is smaller than the sum of its proper divisors (1128121320316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022022102020 is a wasteful number, since it uses less digits than its factorization.
1022022102020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34412 (or 34410 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 1022022102020 its reverse (202012202201), we get a palindrome (1224034304221).
The spelling of 1022022102020 in words is "one trillion, twenty-two billion, twenty-two million, one hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •