Base | Representation |
---|---|
bin | 1001101001001000011… |
… | …10000000010110011101 |
3 | 1011200012021021122011211 |
4 | 10310210032000112131 |
5 | 20412020423224041 |
6 | 412112324144421 |
7 | 32636264443453 |
oct | 4644416002635 |
9 | 1150167248154 |
10 | 331320133021 |
11 | 11856a639859 |
12 | 54266538111 |
13 | 2532185a7b7 |
14 | 12070a2c9d3 |
15 | 8942153481 |
hex | 4d2438059d |
331320133021 has 2 divisors, whose sum is σ = 331320133022. Its totient is φ = 331320133020.
The previous prime is 331320132991. The next prime is 331320133031. The reversal of 331320133021 is 120331023133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 238398804121 + 92921328900 = 488261^2 + 304830^2 .
It is an emirp because it is prime and its reverse (120331023133) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 331320133021 - 213 = 331320124829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 331320132983 and 331320133001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331320133031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165660066510 + 165660066511.
It is an arithmetic number, because the mean of its divisors is an integer number (165660066511).
Almost surely, 2331320133021 is an apocalyptic number.
It is an amenable number.
331320133021 is a deficient number, since it is larger than the sum of its proper divisors (1).
331320133021 is an equidigital number, since it uses as much as digits as its factorization.
331320133021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 331320133021 its reverse (120331023133), we get a palindrome (451651156154).
The spelling of 331320133021 in words is "three hundred thirty-one billion, three hundred twenty million, one hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •