Base | Representation |
---|---|
bin | 10010110010000001100… |
… | …10001110110110010001 |
3 | 2021200201022000110202021 |
4 | 21121000302032312101 |
5 | 41033114443113431 |
6 | 1212243400251441 |
7 | 64423633346461 |
oct | 11310062166621 |
9 | 2250638013667 |
10 | 645332004241 |
11 | 229758102311 |
12 | a50a0470b81 |
13 | 48b15593762 |
14 | 2333ca57ba1 |
15 | 11bbe9dcb11 |
hex | 9640c8ed91 |
645332004241 has 2 divisors, whose sum is σ = 645332004242. Its totient is φ = 645332004240.
The previous prime is 645332004211. The next prime is 645332004259. The reversal of 645332004241 is 142400233546.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 620274380625 + 25057623616 = 787575^2 + 158296^2 .
It is a cyclic number.
It is not a de Polignac number, because 645332004241 - 235 = 610972265873 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 645332004197 and 645332004206.
It is not a weakly prime, because it can be changed into another prime (645332004211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 322666002120 + 322666002121.
It is an arithmetic number, because the mean of its divisors is an integer number (322666002121).
Almost surely, 2645332004241 is an apocalyptic number.
It is an amenable number.
645332004241 is a deficient number, since it is larger than the sum of its proper divisors (1).
645332004241 is an equidigital number, since it uses as much as digits as its factorization.
645332004241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 34.
Adding to 645332004241 its reverse (142400233546), we get a palindrome (787732237787).
The spelling of 645332004241 in words is "six hundred forty-five billion, three hundred thirty-two million, four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •