Base | Representation |
---|---|
bin | 1001011001111000001… |
… | …10111110110000000101 |
3 | 1010220001120000002100011 |
4 | 10230330012332300011 |
5 | 20243233014310203 |
6 | 404235550550221 |
7 | 32226326160415 |
oct | 4547406766005 |
9 | 1126046002304 |
10 | 323131010053 |
11 | 115048038535 |
12 | 5275bb08371 |
13 | 2461809b1c7 |
14 | 118d51b4645 |
15 | 861324b76d |
hex | 4b3c1bec05 |
323131010053 has 16 divisors (see below), whose sum is σ = 331486038000. Its totient is φ = 314885652480.
The previous prime is 323131010047. The next prime is 323131010057. The reversal of 323131010053 is 350010131323.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 182908471684 + 140222538369 = 427678^2 + 374463^2 .
It is a cyclic number.
It is not a de Polignac number, because 323131010053 - 25 = 323131010021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323131010057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3489925 + ... + 3581317.
It is an arithmetic number, because the mean of its divisors is an integer number (20717877375).
Almost surely, 2323131010053 is an apocalyptic number.
It is an amenable number.
323131010053 is a deficient number, since it is larger than the sum of its proper divisors (8355027947).
323131010053 is a wasteful number, since it uses less digits than its factorization.
323131010053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91992.
The product of its (nonzero) digits is 810, while the sum is 22.
Adding to 323131010053 its reverse (350010131323), we get a palindrome (673141141376).
The spelling of 323131010053 in words is "three hundred twenty-three billion, one hundred thirty-one million, ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •