Base | Representation |
---|---|
bin | 100110110011001100110… |
… | …0100001000101110010001 |
3 | 200212210110012122121110111 |
4 | 1031212121210020232101 |
5 | 1144332211441120142 |
6 | 15201435441001321 |
7 | 1060161363631132 |
oct | 115463144105621 |
9 | 20783405577414 |
10 | 5332630801297 |
11 | 177661307a838 |
12 | 7215bb323241 |
13 | 2c8b32323807 |
14 | 14615a4b1c89 |
15 | 93aa9970e17 |
hex | 4d999908b91 |
5332630801297 has 2 divisors, whose sum is σ = 5332630801298. Its totient is φ = 5332630801296.
The previous prime is 5332630801259. The next prime is 5332630801319. The reversal of 5332630801297 is 7921080362335.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3741377221696 + 1591253579601 = 1934264^2 + 1261449^2 .
It is a cyclic number.
It is not a de Polignac number, because 5332630801297 - 227 = 5332496583569 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5332630801297.
It is not a weakly prime, because it can be changed into another prime (5332630801397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2666315400648 + 2666315400649.
It is an arithmetic number, because the mean of its divisors is an integer number (2666315400649).
Almost surely, 25332630801297 is an apocalyptic number.
It is an amenable number.
5332630801297 is a deficient number, since it is larger than the sum of its proper divisors (1).
5332630801297 is an equidigital number, since it uses as much as digits as its factorization.
5332630801297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 49.
The spelling of 5332630801297 in words is "five trillion, three hundred thirty-two billion, six hundred thirty million, eight hundred one thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •