Base | Representation |
---|---|
bin | 100001100000000101110… |
… | …101111110001101110000 |
3 | 22011002101022102010100210 |
4 | 201200011311332031300 |
5 | 300204401312131300 |
6 | 4521341042344120 |
7 | 325220450262441 |
oct | 41400565761560 |
9 | 8132338363323 |
10 | 2302200505200 |
11 | 8083a3192222 |
12 | 31222235b040 |
13 | 13913424055b |
14 | 7d5d9d612c8 |
15 | 3ed43958050 |
hex | 21805d7e370 |
2302200505200 has 60 divisors (see below), whose sum is σ = 7374715622168. Its totient is φ = 613920134400.
The previous prime is 2302200505181. The next prime is 2302200505307. The reversal of 2302200505200 is 25050022032.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-2 number, since 2×23022005052002 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 959249011 + ... + 959251410.
Almost surely, 22302200505200 is an apocalyptic number.
2302200505200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2302200505200 is an abundant number, since it is smaller than the sum of its proper divisors (5072515116968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2302200505200 is a wasteful number, since it uses less digits than its factorization.
2302200505200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1918500442 (or 1918500431 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 21.
Adding to 2302200505200 its reverse (25050022032), we get a palindrome (2327250527232).
The spelling of 2302200505200 in words is "two trillion, three hundred two billion, two hundred million, five hundred five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •