Base | Representation |
---|---|
bin | 101001001101110110001… |
… | …0011001010111011110001 |
3 | 202001112122212102012022202 |
4 | 1102123230103022323301 |
5 | 1220302332211012000 |
6 | 20014201444112545 |
7 | 1123156215651413 |
oct | 122335423127361 |
9 | 22045585365282 |
10 | 5664731344625 |
11 | 189444318a391 |
12 | 775a43095755 |
13 | 321249765752 |
14 | 158262a0a9b3 |
15 | 9c54537bdd5 |
hex | 526ec4caef1 |
5664731344625 has 16 divisors (see below), whose sum is σ = 7069675179216. Its totient is φ = 4531727088000.
The previous prime is 5664731344579. The next prime is 5664731344627. The reversal of 5664731344625 is 5264431374665.
It can be written as a sum of positive squares in 8 ways, for example, as 2366588410384 + 3298142934241 = 1538372^2 + 1816079^2 .
It is not a de Polignac number, because 5664731344625 - 212 = 5664731340529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5664731344627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11393735 + ... + 11880515.
It is an arithmetic number, because the mean of its divisors is an integer number (441854698701).
Almost surely, 25664731344625 is an apocalyptic number.
It is an amenable number.
5664731344625 is a deficient number, since it is larger than the sum of its proper divisors (1404943834591).
5664731344625 is an equidigital number, since it uses as much as digits as its factorization.
5664731344625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 579893 (or 579883 counting only the distinct ones).
The product of its digits is 43545600, while the sum is 56.
The spelling of 5664731344625 in words is "five trillion, six hundred sixty-four billion, seven hundred thirty-one million, three hundred forty-four thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •