Base | Representation |
---|---|
bin | 100100101111101011110010… |
… | …0110101011010011011010010 |
3 | 1120101101212021121110201000122 |
4 | 1021133113210311122123102 |
5 | 314331010222330224020 |
6 | 3103230001452350242 |
7 | 125036240525516300 |
oct | 11137274465323322 |
9 | 1511355247421018 |
10 | 323213013133010 |
11 | 93a92961849910 |
12 | 30300a20175382 |
13 | 10b46b19557200 |
14 | 59b5844055270 |
15 | 27577a3a56125 |
hex | 125f5e4d5a6d2 |
323213013133010 has 288 divisors, whose sum is σ = 810404816735232. Its totient is φ = 91718468674560.
The previous prime is 323213013132991. The next prime is 323213013133019. The reversal of 323213013133010 is 10331310312323.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (323213013133019) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 64066127 + ... + 68926733.
It is an arithmetic number, because the mean of its divisors is an integer number (2813905613664).
Almost surely, 2323213013133010 is an apocalyptic number.
323213013133010 is an abundant number, since it is smaller than the sum of its proper divisors (487191803602222).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323213013133010 is a wasteful number, since it uses less digits than its factorization.
323213013133010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4860738 (or 4860718 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 323213013133010 its reverse (10331310312323), we get a palindrome (333544323445333).
The spelling of 323213013133010 in words is "three hundred twenty-three trillion, two hundred thirteen billion, thirteen million, one hundred thirty-three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •