Base | Representation |
---|---|
bin | 100000000000111100000… |
… | …001101010000100111000 |
3 | 21210022122220012002210120 |
4 | 200000330001222010320 |
5 | 242021130230314000 |
6 | 4402402513013240 |
7 | 314642542124226 |
oct | 40007401520470 |
9 | 7708586162716 |
10 | 2200030323000 |
11 | 779033843114 |
12 | 2b6469854220 |
13 | 12c600c3c543 |
14 | 786a69c5b16 |
15 | 3c363e416a0 |
hex | 2003c06a138 |
2200030323000 has 128 divisors (see below), whose sum is σ = 7049611033920. Its totient is φ = 570818649600.
The previous prime is 2200030322983. The next prime is 2200030323017. The reversal of 2200030323000 is 3230300022.
It is an interprime number because it is at equal distance from previous prime (2200030322983) and next prime (2200030323017).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9799047 + ... + 10021046.
Almost surely, 22200030323000 is an apocalyptic number.
2200030323000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2200030323000 is an abundant number, since it is smaller than the sum of its proper divisors (4849580710920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200030323000 is a wasteful number, since it uses less digits than its factorization.
2200030323000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19820154 (or 19820140 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 15.
Adding to 2200030323000 its reverse (3230300022), we get a palindrome (2203260623022).
The spelling of 2200030323000 in words is "two trillion, two hundred billion, thirty million, three hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •