Base | Representation |
---|---|
bin | 100101101001111001001110… |
… | …0010010100111010000000101 |
3 | 1121102201200110202111211112021 |
4 | 1023103302130102213100011 |
5 | 321403044334422422042 |
6 | 3132233144304323141 |
7 | 126523241560101325 |
oct | 11323623422472005 |
9 | 1542650422454467 |
10 | 331213320123397 |
11 | 96597864550508 |
12 | 3119343a9134b1 |
13 | 112a7388925b8a |
14 | 5bb0b4b3a7285 |
15 | 284594290b867 |
hex | 12d3c9c4a7405 |
331213320123397 has 2 divisors, whose sum is σ = 331213320123398. Its totient is φ = 331213320123396.
The previous prime is 331213320123353. The next prime is 331213320123451. The reversal of 331213320123397 is 793321023312133.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 324594668613121 + 6618651510276 = 18016511^2 + 2572674^2 .
It is a cyclic number.
It is not a de Polignac number, because 331213320123397 - 215 = 331213320090629 is a prime.
It is a super-2 number, since 2×3312133201233972 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331213320124397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165606660061698 + 165606660061699.
It is an arithmetic number, because the mean of its divisors is an integer number (165606660061699).
Almost surely, 2331213320123397 is an apocalyptic number.
It is an amenable number.
331213320123397 is a deficient number, since it is larger than the sum of its proper divisors (1).
331213320123397 is an equidigital number, since it uses as much as digits as its factorization.
331213320123397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 367416, while the sum is 43.
The spelling of 331213320123397 in words is "three hundred thirty-one trillion, two hundred thirteen billion, three hundred twenty million, one hundred twenty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •