Base | Representation |
---|---|
bin | 100110011100100… |
… | …000100001010001 |
3 | 1122221200202212111 |
4 | 212130200201101 |
5 | 2310110214231 |
6 | 144000425321 |
7 | 21661321111 |
oct | 4634404121 |
9 | 1587622774 |
10 | 645007441 |
11 | 3010a9701 |
12 | 160018241 |
13 | a3826710 |
14 | 61941041 |
15 | 3b95d4b1 |
hex | 26720851 |
645007441 has 8 divisors (see below), whose sum is σ = 699287400. Its totient is φ = 591393792.
The previous prime is 645007427. The next prime is 645007457. The reversal of 645007441 is 144700546.
It can be written as a sum of positive squares in 4 ways, for example, as 79281216 + 565726225 = 8904^2 + 23785^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-645007441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (645007471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164560 + ... + 168433.
It is an arithmetic number, because the mean of its divisors is an integer number (87410925).
Almost surely, 2645007441 is an apocalyptic number.
It is an amenable number.
645007441 is a deficient number, since it is larger than the sum of its proper divisors (54279959).
645007441 is a wasteful number, since it uses less digits than its factorization.
645007441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333155.
The product of its (nonzero) digits is 13440, while the sum is 31.
The square root of 645007441 is about 25396.9966925225. The cubic root of 645007441 is about 864.0155822986.
Adding to 645007441 its reverse (144700546), we get a palindrome (789707987).
The spelling of 645007441 in words is "six hundred forty-five million, seven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •