Base | Representation |
---|---|
bin | 100110101101111011110… |
… | …1000111111101001110001 |
3 | 200211201021020100100020001 |
4 | 1031123313220333221301 |
5 | 1144141033000400111 |
6 | 15152325501550001 |
7 | 1056311242443142 |
oct | 115336750775161 |
9 | 20751236310201 |
10 | 5321324231281 |
11 | 17718408903a3 |
12 | 71b384875301 |
13 | 2c7a4ca3aab6 |
14 | 1457a69dbac9 |
15 | 936470261c1 |
hex | 4d6f7a3fa71 |
5321324231281 has 2 divisors, whose sum is σ = 5321324231282. Its totient is φ = 5321324231280.
The previous prime is 5321324231177. The next prime is 5321324231297. The reversal of 5321324231281 is 1821324231235.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4332055286881 + 989268944400 = 2081359^2 + 994620^2 .
It is a cyclic number.
It is not a de Polignac number, because 5321324231281 - 223 = 5321315842673 is a prime.
It is a super-2 number, since 2×53213242312812 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5321324231281.
It is not a weakly prime, because it can be changed into another prime (5321324931281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2660662115640 + 2660662115641.
It is an arithmetic number, because the mean of its divisors is an integer number (2660662115641).
Almost surely, 25321324231281 is an apocalyptic number.
It is an amenable number.
5321324231281 is a deficient number, since it is larger than the sum of its proper divisors (1).
5321324231281 is an equidigital number, since it uses as much as digits as its factorization.
5321324231281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69120, while the sum is 37.
The spelling of 5321324231281 in words is "five trillion, three hundred twenty-one billion, three hundred twenty-four million, two hundred thirty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •