Base | Representation |
---|---|
bin | 11101101111101001000… |
… | …11100101110111110100 |
3 | 10121200222122112110012010 |
4 | 32313310203211313310 |
5 | 113221034104020040 |
6 | 2101301025524220 |
7 | 133560236351466 |
oct | 16676443456764 |
9 | 3550878473163 |
10 | 1022010220020 |
11 | 364483141a79 |
12 | 1460a51a3670 |
13 | 754b528857a |
14 | 376736c8136 |
15 | 1b8b8c12e80 |
hex | edf48e5df4 |
1022010220020 has 48 divisors (see below), whose sum is σ = 3012240651840. Its totient is φ = 258192055296.
The previous prime is 1022010219983. The next prime is 1022010220031. The reversal of 1022010220020 is 200220102201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1022010219978 and 1022010220005.
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, 448248957 + ... + 448251236.
It is an arithmetic number, because the mean of its divisors is an integer number (62755013580).
Almost surely, 21022010220020 is an apocalyptic number.
1022010220020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022010220020 is an abundant number, since it is smaller than the sum of its proper divisors (1990230431820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022010220020 is a wasteful number, since it uses less digits than its factorization.
1022010220020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896500224 (or 896500222 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 1022010220020 its reverse (200220102201), we get a palindrome (1222230322221).
The spelling of 1022010220020 in words is "one trillion, twenty-two billion, ten million, two hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •