Base | Representation |
---|---|
bin | 11101011011010101000… |
… | …111010101101100100000 |
3 | 21011022200022001211110101 |
4 | 131123111013111230200 |
5 | 231112441241200000 |
6 | 4144553540312144 |
7 | 266046152145136 |
oct | 35332507255440 |
9 | 7138608054411 |
10 | 2022210100000 |
11 | 70a683978732 |
12 | 287b020a2654 |
13 | 118902a9888c |
14 | 6dc384c1756 |
15 | 37907cace6a |
hex | 1d6d51d5b20 |
2022210100000 has 72 divisors (see below), whose sum is σ = 4976214415956. Its totient is φ = 808884000000.
The previous prime is 2022210099989. The next prime is 2022210100019. The reversal of 2022210100000 is 10122202.
It can be written as a sum of positive squares in 6 ways, for example, as 615238416 + 2021594861584 = 24804^2 + 1421828^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a self number, because there is not a number n which added to its sum of digits gives 2022210100000.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10011051 + ... + 10211050.
Almost surely, 22022210100000 is an apocalyptic number.
2022210100000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2022210100000 is an abundant number, since it is smaller than the sum of its proper divisors (2954004315956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2022210100000 is an frugal number, since it uses more digits than its factorization.
2022210100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20222136 (or 20222108 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 2022210100000 its reverse (10122202), we get a palindrome (2022220222202).
The spelling of 2022210100000 in words is "two trillion, twenty-two billion, two hundred ten million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •