Base | Representation |
---|---|
bin | 10010110010001111110… |
… | …10100010111100110001 |
3 | 2021201000122002210112122 |
4 | 21121013322202330301 |
5 | 41033341103433431 |
6 | 1212303312204025 |
7 | 64426615166024 |
oct | 11310772427461 |
9 | 2251018083478 |
10 | 645451624241 |
11 | 229809684616 |
12 | a5114539615 |
13 | 48b342b6718 |
14 | 233508b51bb |
15 | 11bca26aa7b |
hex | 9647ea2f31 |
645451624241 has 16 divisors (see below), whose sum is σ = 669636752400. Its totient is φ = 621624556800.
The previous prime is 645451624171. The next prime is 645451624243. The reversal of 645451624241 is 142426154546.
It can be written as a sum of positive squares in 8 ways, for example, as 25301674225 + 620149950016 = 159065^2 + 787496^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-645451624241 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 645451624192 and 645451624201.
It is not an unprimeable number, because it can be changed into a prime (645451624243) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15513935 + ... + 15555483.
It is an arithmetic number, because the mean of its divisors is an integer number (41852297025).
Almost surely, 2645451624241 is an apocalyptic number.
It is an amenable number.
645451624241 is a deficient number, since it is larger than the sum of its proper divisors (24185128159).
645451624241 is a wasteful number, since it uses less digits than its factorization.
645451624241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45844.
The product of its digits is 921600, while the sum is 44.
Adding to 645451624241 its reverse (142426154546), we get a palindrome (787877778787).
The spelling of 645451624241 in words is "six hundred forty-five billion, four hundred fifty-one million, six hundred twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •