Base | Representation |
---|---|
bin | 1001011100111011110110011… |
… | …1000111111110101110110101 |
3 | 10020020001010011211201212012201 |
4 | 2113032331213013332232311 |
5 | 1144140020344112140103 |
6 | 10314341555204144501 |
7 | 260046201666620206 |
oct | 22716754707765665 |
9 | 3206033154655181 |
10 | 665133250505653 |
11 | 182a28477a16746 |
12 | 62723343998131 |
13 | 22719a47897007 |
14 | ba3689a3cb5ad |
15 | 51d699787d51d |
hex | 25cef671febb5 |
665133250505653 has 2 divisors, whose sum is σ = 665133250505654. Its totient is φ = 665133250505652.
The previous prime is 665133250505617. The next prime is 665133250505681. The reversal of 665133250505653 is 356505052331566.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 520286200507089 + 144847049998564 = 22809783^2 + 12035242^2 .
It is a cyclic number.
It is not a de Polignac number, because 665133250505653 - 221 = 665133248408501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 665133250505594 and 665133250505603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (665133250505683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 332566625252826 + 332566625252827.
It is an arithmetic number, because the mean of its divisors is an integer number (332566625252827).
Almost surely, 2665133250505653 is an apocalyptic number.
It is an amenable number.
665133250505653 is a deficient number, since it is larger than the sum of its proper divisors (1).
665133250505653 is an equidigital number, since it uses as much as digits as its factorization.
665133250505653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36450000, while the sum is 55.
The spelling of 665133250505653 in words is "six hundred sixty-five trillion, one hundred thirty-three billion, two hundred fifty million, five hundred five thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •