Base | Representation |
---|---|
bin | 100100011010100100011100… |
… | …1010010110011010011011101 |
3 | 1120000010102202120102112022001 |
4 | 1020311020321102303103131 |
5 | 313440433443222344013 |
6 | 3053124505022322301 |
7 | 124316464660040446 |
oct | 11065107122632335 |
9 | 1500112676375261 |
10 | 320311032231133 |
11 | 93074167226349 |
12 | 2bb12510729391 |
13 | 1099627c018468 |
14 | 59151cb0962cd |
15 | 27070596acddd |
hex | 12352394b34dd |
320311032231133 has 2 divisors, whose sum is σ = 320311032231134. Its totient is φ = 320311032231132.
The previous prime is 320311032231079. The next prime is 320311032231173. The reversal of 320311032231133 is 331132230113023.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 238780281635289 + 81530750595844 = 15452517^2 + 9029438^2 .
It is a cyclic number.
It is not a de Polignac number, because 320311032231133 - 217 = 320311032100061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320311032231173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160155516115566 + 160155516115567.
It is an arithmetic number, because the mean of its divisors is an integer number (160155516115567).
Almost surely, 2320311032231133 is an apocalyptic number.
It is an amenable number.
320311032231133 is a deficient number, since it is larger than the sum of its proper divisors (1).
320311032231133 is an equidigital number, since it uses as much as digits as its factorization.
320311032231133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 320311032231133 its reverse (331132230113023), we get a palindrome (651443262344156).
The spelling of 320311032231133 in words is "three hundred twenty trillion, three hundred eleven billion, thirty-two million, two hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •