Base | Representation |
---|---|
bin | 100110110101011001100… |
… | …0000001000010100011001 |
3 | 200220020122021102122200021 |
4 | 1031222303000020110121 |
5 | 1144421344222143434 |
6 | 15203540152110441 |
7 | 1060416400005406 |
oct | 115526300102431 |
9 | 20806567378607 |
10 | 5337352537369 |
11 | 17786163a9a56 |
12 | 7224b8695421 |
13 | 2c9405624c98 |
14 | 14648761b2ad |
15 | 93c8425dcb4 |
hex | 4dab3008519 |
5337352537369 has 2 divisors, whose sum is σ = 5337352537370. Its totient is φ = 5337352537368.
The previous prime is 5337352537313. The next prime is 5337352537403. The reversal of 5337352537369 is 9637352537335.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3606246576144 + 1731105961225 = 1899012^2 + 1315715^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5337352537369 is a prime.
It is a super-2 number, since 2×53373525373692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5337352537169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2668676268684 + 2668676268685.
It is an arithmetic number, because the mean of its divisors is an integer number (2668676268685).
Almost surely, 25337352537369 is an apocalyptic number.
It is an amenable number.
5337352537369 is a deficient number, since it is larger than the sum of its proper divisors (1).
5337352537369 is an equidigital number, since it uses as much as digits as its factorization.
5337352537369 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 160744500, while the sum is 61.
The spelling of 5337352537369 in words is "five trillion, three hundred thirty-seven billion, three hundred fifty-two million, five hundred thirty-seven thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •