Base | Representation |
---|---|
bin | 100001101010011100110… |
… | …100001001001110001000 |
3 | 22012011002110221200002220 |
4 | 201222130310021032020 |
5 | 300400141232221300 |
6 | 4530420455054040 |
7 | 326063210532504 |
oct | 41523464111610 |
9 | 8164073850086 |
10 | 2313323320200 |
11 | 812090784812 |
12 | 314407371320 |
13 | 13a1b77391a9 |
14 | 7dd73281304 |
15 | 402951a6da0 |
hex | 21a9cd09388 |
2313323320200 has 48 divisors (see below), whose sum is σ = 7171302294480. Its totient is φ = 616886218560.
The previous prime is 2313323320097. The next prime is 2313323320213. The reversal of 2313323320200 is 20233233132.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1927768834 + ... + 1927770033.
It is an arithmetic number, because the mean of its divisors is an integer number (149402131135).
Almost surely, 22313323320200 is an apocalyptic number.
2313323320200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2313323320200 is an abundant number, since it is smaller than the sum of its proper divisors (4857978974280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2313323320200 is a wasteful number, since it uses less digits than its factorization.
2313323320200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3855538886 (or 3855538877 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 2313323320200 its reverse (20233233132), we get a palindrome (2333556553332).
The spelling of 2313323320200 in words is "two trillion, three hundred thirteen billion, three hundred twenty-three million, three hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •