Base | Representation |
---|---|
bin | 100110101101111110001… |
… | …1001110101111001001111 |
3 | 200211201110210201101112222 |
4 | 1031123330121311321033 |
5 | 1144141213430121411 |
6 | 15152341434445555 |
7 | 1056313232630336 |
oct | 115337431657117 |
9 | 20751423641488 |
10 | 5321404145231 |
11 | 1771881a02989 |
12 | 71b3a75938bb |
13 | 2c7a6346ac65 |
14 | 1457b3480d1d |
15 | 9364e05e4db |
hex | 4d6fc675e4f |
5321404145231 has 2 divisors, whose sum is σ = 5321404145232. Its totient is φ = 5321404145230.
The previous prime is 5321404145023. The next prime is 5321404145257. The reversal of 5321404145231 is 1325414041235.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5321404145231 is a prime.
It is a super-2 number, since 2×53214041452312 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 5321404145191 and 5321404145200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5321404145731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2660702072615 + 2660702072616.
It is an arithmetic number, because the mean of its divisors is an integer number (2660702072616).
Almost surely, 25321404145231 is an apocalyptic number.
5321404145231 is a deficient number, since it is larger than the sum of its proper divisors (1).
5321404145231 is an equidigital number, since it uses as much as digits as its factorization.
5321404145231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 5321404145231 its reverse (1325414041235), we get a palindrome (6646818186466).
The spelling of 5321404145231 in words is "five trillion, three hundred twenty-one billion, four hundred four million, one hundred forty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •