Base | Representation |
---|---|
bin | 100101101000011011001010… |
… | …1011101010101011001100101 |
3 | 1121102000101010120002121121122 |
4 | 1023100312111131111121211 |
5 | 321341242212024433222 |
6 | 3132000302233023325 |
7 | 126502531426453415 |
oct | 11320662535253145 |
9 | 1542011116077548 |
10 | 331011342030437 |
11 | 9651a138145842 |
12 | 31160270854b45 |
13 | 1129130a85cac3 |
14 | 5ba506a6d0645 |
15 | 28405709a0a42 |
hex | 12d0d95755665 |
331011342030437 has 2 divisors, whose sum is σ = 331011342030438. Its totient is φ = 331011342030436.
The previous prime is 331011342030389. The next prime is 331011342030449. The reversal of 331011342030437 is 734030243110133.
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., 254530562712196 + 76480779318241 = 15954014^2 + 8745329^2 .
It is a cyclic number.
It is not a de Polignac number, because 331011342030437 - 210 = 331011342029413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 331011342030397 and 331011342030406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331011342030487) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165505671015218 + 165505671015219.
It is an arithmetic number, because the mean of its divisors is an integer number (165505671015219).
Almost surely, 2331011342030437 is an apocalyptic number.
It is an amenable number.
331011342030437 is a deficient number, since it is larger than the sum of its proper divisors (1).
331011342030437 is an equidigital number, since it uses as much as digits as its factorization.
331011342030437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 35.
The spelling of 331011342030437 in words is "three hundred thirty-one trillion, eleven billion, three hundred forty-two million, thirty thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •