Base | Representation |
---|---|
bin | 11101011011001001010… |
… | …100000111000001110000 |
3 | 21011022011111112110121020 |
4 | 131123021110013001300 |
5 | 231112040100334300 |
6 | 4144522145055440 |
7 | 266041226306361 |
oct | 35331124070160 |
9 | 7138144473536 |
10 | 2022012121200 |
11 | 70a592146295 |
12 | 287a67927580 |
13 | 1188a0a6b566 |
14 | 6dc1a0a7b68 |
15 | 378e57028a0 |
hex | 1d6c9507070 |
2022012121200 has 120 divisors (see below), whose sum is σ = 6477626665776. Its totient is φ = 539165952000.
The previous prime is 2022012121133. The next prime is 2022012121219. The reversal of 2022012121200 is 21212102202.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2022012121200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20255410 + ... + 20354990.
Almost surely, 22022012121200 is an apocalyptic number.
2022012121200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2022012121200 is an abundant number, since it is smaller than the sum of its proper divisors (4455614544576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2022012121200 is a wasteful number, since it uses less digits than its factorization.
2022012121200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116523 (or 116512 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2022012121200 its reverse (21212102202), we get a palindrome (2043224223402).
The spelling of 2022012121200 in words is "two trillion, twenty-two billion, twelve million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •