Base | Representation |
---|---|
bin | 100000000001001001010… |
… | …011100110110011100000 |
3 | 21210100020102102222021202 |
4 | 200001021103212303200 |
5 | 242022104300211000 |
6 | 4402440552340332 |
7 | 314651216020160 |
oct | 40011123466340 |
9 | 7710212388252 |
10 | 2200253132000 |
11 | 779138594890 |
12 | 2b65103a46a8 |
13 | 12c6381516a1 |
14 | 786c84245a0 |
15 | 3c3787a3dd5 |
hex | 200494e6ce0 |
2200253132000 has 192 divisors, whose sum is σ = 6739976355840. Its totient is φ = 685793088000.
The previous prime is 2200253131987. The next prime is 2200253132041. The reversal of 2200253132000 is 2313520022.
It is a super-2 number, since 2×22002531320002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3263840 + ... + 3879839.
It is an arithmetic number, because the mean of its divisors is an integer number (35104043520).
Almost surely, 22200253132000 is an apocalyptic number.
2200253132000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2200253132000 is an abundant number, since it is smaller than the sum of its proper divisors (4539723223840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200253132000 is a wasteful number, since it uses less digits than its factorization.
2200253132000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7143722 (or 7143704 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 20.
Adding to 2200253132000 its reverse (2313520022), we get a palindrome (2202566652022).
The spelling of 2200253132000 in words is "two trillion, two hundred billion, two hundred fifty-three million, one hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •