Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …100101010111100110100 |
3 | 21011022122122222010002112 |
4 | 131123110210222330310 |
5 | 231112431424341040 |
6 | 4144553013430152 |
7 | 266046011664440 |
oct | 35332444527464 |
9 | 7138578863075 |
10 | 2022201012020 |
11 | 70a679830802 |
12 | 287abb03b358 |
13 | 118900c36187 |
14 | 6dc371d7820 |
15 | 379070b5365 |
hex | 1d6d492af34 |
2022201012020 has 48 divisors (see below), whose sum is σ = 5020637005440. Its totient is φ = 669418264704.
The previous prime is 2022201011969. The next prime is 2022201012079. The reversal of 2022201012020 is 202101022202.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 2022201011986 and 2022201012004.
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, 249035474 + ... + 249043593.
It is an arithmetic number, because the mean of its divisors is an integer number (104596604280).
Almost surely, 22022201012020 is an apocalyptic number.
2022201012020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2022201012020 is an abundant number, since it is smaller than the sum of its proper divisors (2998435993420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2022201012020 is a wasteful number, since it uses less digits than its factorization.
2022201012020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 498079112 (or 498079110 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 2022201012020 its reverse (202101022202), we get a palindrome (2224302034222).
The spelling of 2022201012020 in words is "two trillion, twenty-two billion, two hundred one million, twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •