Base | Representation |
---|---|
bin | 1010000110001010101000… |
… | …10010111011011011110000 |
3 | 2220121111111112111022112212 |
4 | 11003011110102323123300 |
5 | 10402224400122414300 |
6 | 115115300511511252 |
7 | 4451022511626353 |
oct | 503052422733360 |
9 | 86544445438485 |
10 | 22202100201200 |
11 | 708a948835297 |
12 | 25a6aba528528 |
13 | c50858cc587a |
14 | 56a831acc29a |
15 | 2877da88e935 |
hex | 1431544bb6f0 |
22202100201200 has 120 divisors (see below), whose sum is σ = 55665839786208. Its totient is φ = 8493779543040.
The previous prime is 22202100201133. The next prime is 22202100201257. The reversal of 22202100201200 is 210200120222.
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, 86323994 + ... + 86580806.
Almost surely, 222202100201200 is an apocalyptic number.
22202100201200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22202100201200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27832919893104).
22202100201200 is an abundant number, since it is smaller than the sum of its proper divisors (33463739585008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22202100201200 is a wasteful number, since it uses less digits than its factorization.
22202100201200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266251 (or 266240 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 22202100201200 its reverse (210200120222), we get a palindrome (22412300321422).
The spelling of 22202100201200 in words is "twenty-two trillion, two hundred two billion, one hundred million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •