Base | Representation |
---|---|
bin | 1001011010001110110… |
… | …00010110100010010100 |
3 | 1010220112201211112020010 |
4 | 10231013120112202110 |
5 | 20244124422111200 |
6 | 404310424040220 |
7 | 32234113422012 |
oct | 4550730264224 |
9 | 1126481745203 |
10 | 323320113300 |
11 | 115134858608 |
12 | 527b3303070 |
13 | 2464830b712 |
14 | 1191235b8b2 |
15 | 8624b52150 |
hex | 4b47616894 |
323320113300 has 72 divisors (see below), whose sum is σ = 935580181536. Its totient is φ = 86208805760.
The previous prime is 323320113289. The next prime is 323320113301. The reversal of 323320113300 is 3311023323.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323320113301) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 2773999 + ... + 2888201.
It is an arithmetic number, because the mean of its divisors is an integer number (12994169188).
Almost surely, 2323320113300 is an apocalyptic number.
323320113300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
323320113300 is an abundant number, since it is smaller than the sum of its proper divisors (612260068236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323320113300 is a wasteful number, since it uses less digits than its factorization.
323320113300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123657 (or 123650 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 323320113300 its reverse (3311023323), we get a palindrome (326631136623).
The spelling of 323320113300 in words is "three hundred twenty-three billion, three hundred twenty million, one hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •