Base | Representation |
---|---|
bin | 1001011100010011001110011… |
… | …1111100111011101101110011 |
3 | 10020010120101201201022120002201 |
4 | 2113010303213330323231303 |
5 | 1144042102030020420311 |
6 | 10313045213332524031 |
7 | 256644603635123245 |
oct | 22704634774735563 |
9 | 3203511651276081 |
10 | 664435332201331 |
11 | 1827894952638a9 |
12 | 62630028480617 |
13 | 22698ca17a9582 |
14 | ba10bad76a095 |
15 | 51c374b4249c1 |
hex | 25c4ce7f3bb73 |
664435332201331 has 2 divisors, whose sum is σ = 664435332201332. Its totient is φ = 664435332201330.
The previous prime is 664435332201293. The next prime is 664435332201343. The reversal of 664435332201331 is 133102233534466.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 664435332201331 - 229 = 664434795330419 is a prime.
It is a super-2 number, since 2×6644353322013312 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (664435332201391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 332217666100665 + 332217666100666.
It is an arithmetic number, because the mean of its divisors is an integer number (332217666100666).
Almost surely, 2664435332201331 is an apocalyptic number.
664435332201331 is a deficient number, since it is larger than the sum of its proper divisors (1).
664435332201331 is an equidigital number, since it uses as much as digits as its factorization.
664435332201331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2799360, while the sum is 46.
Adding to 664435332201331 its reverse (133102233534466), we get a palindrome (797537565735797).
The spelling of 664435332201331 in words is "six hundred sixty-four trillion, four hundred thirty-five billion, three hundred thirty-two million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •