Base | Representation |
---|---|
bin | 101000111110010010100… |
… | …1101011110101100011001 |
3 | 201221100102211010222110202 |
4 | 1101330211031132230121 |
5 | 1214230424030300031 |
6 | 15550555020351545 |
7 | 1120564342516043 |
oct | 121744515365431 |
9 | 21840384128422 |
10 | 5631326415641 |
11 | 1881260a53863 |
12 | 76b47b9a55b5 |
13 | 31b054b40194 |
14 | 1567b42b0a93 |
15 | 9b73c8752cb |
hex | 51f2535eb19 |
5631326415641 has 2 divisors, whose sum is σ = 5631326415642. Its totient is φ = 5631326415640.
The previous prime is 5631326415623. The next prime is 5631326415647. The reversal of 5631326415641 is 1465146231365.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3971235897616 + 1660090518025 = 1992796^2 + 1288445^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5631326415641 is a prime.
It is a super-2 number, since 2×56313264156412 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5631326415647) 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 as a sum of consecutive naturals, namely, 2815663207820 + 2815663207821.
It is an arithmetic number, because the mean of its divisors is an integer number (2815663207821).
Almost surely, 25631326415641 is an apocalyptic number.
It is an amenable number.
5631326415641 is a deficient number, since it is larger than the sum of its proper divisors (1).
5631326415641 is an equidigital number, since it uses as much as digits as its factorization.
5631326415641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1555200, while the sum is 47.
The spelling of 5631326415641 in words is "five trillion, six hundred thirty-one billion, three hundred twenty-six million, four hundred fifteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •