Base | Representation |
---|---|
bin | 100110101111011000100… |
… | …0000010010111100000101 |
3 | 200212000021222011021210012 |
4 | 1031132301000102330011 |
5 | 1144213420113441144 |
6 | 15154002233440005 |
7 | 1056451304214311 |
oct | 115366100227405 |
9 | 20760258137705 |
10 | 5324434124549 |
11 | 177309728a221 |
12 | 71bab2270005 |
13 | 2c812711ac27 |
14 | 1459bda4cb41 |
15 | 9377a075e9e |
hex | 4d7b1012f05 |
5324434124549 has 2 divisors, whose sum is σ = 5324434124550. Its totient is φ = 5324434124548.
The previous prime is 5324434124521. The next prime is 5324434124591. The reversal of 5324434124549 is 9454214344235.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5091476344900 + 232957779649 = 2256430^2 + 482657^2 .
It is a cyclic number.
It is not a de Polignac number, because 5324434124549 - 28 = 5324434124293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5324434124497 and 5324434124506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5324430124549) 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, 2662217062274 + 2662217062275.
It is an arithmetic number, because the mean of its divisors is an integer number (2662217062275).
Almost surely, 25324434124549 is an apocalyptic number.
It is an amenable number.
5324434124549 is a deficient number, since it is larger than the sum of its proper divisors (1).
5324434124549 is an equidigital number, since it uses as much as digits as its factorization.
5324434124549 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8294400, while the sum is 50.
The spelling of 5324434124549 in words is "five trillion, three hundred twenty-four billion, four hundred thirty-four million, one hundred twenty-four thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •