Base | Representation |
---|---|
bin | 1001011100110110100111100… |
… | …0001111010111001110100001 |
3 | 10020012201112010001112122111011 |
4 | 2113031221320033113032201 |
5 | 1144132032231343343244 |
6 | 10314232405541420521 |
7 | 260036540005414063 |
oct | 22715517017271641 |
9 | 3205645101478434 |
10 | 665043343340449 |
11 | 1829a3330742827 |
12 | 62709a3210a741 |
13 | 2271141a07a088 |
14 | ba323ab977733 |
15 | 51d448473d434 |
hex | 25cda783d73a1 |
665043343340449 has 2 divisors, whose sum is σ = 665043343340450. Its totient is φ = 665043343340448.
The previous prime is 665043343340443. The next prime is 665043343340573. The reversal of 665043343340449 is 944043343340566.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 583607031361600 + 81436311978849 = 24157960^2 + 9024207^2 .
It is a cyclic number.
It is not a de Polignac number, because 665043343340449 - 29 = 665043343339937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 665043343340393 and 665043343340402.
It is not a weakly prime, because it can be changed into another prime (665043343340443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 332521671670224 + 332521671670225.
It is an arithmetic number, because the mean of its divisors is an integer number (332521671670225).
Almost surely, 2665043343340449 is an apocalyptic number.
It is an amenable number.
665043343340449 is a deficient number, since it is larger than the sum of its proper divisors (1).
665043343340449 is an equidigital number, since it uses as much as digits as its factorization.
665043343340449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 134369280, while the sum is 58.
The spelling of 665043343340449 in words is "six hundred sixty-five trillion, forty-three billion, three hundred forty-three million, three hundred forty thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •