Base | Representation |
---|---|
bin | 100111100110010111110… |
… | …0100000001001011111101 |
3 | 201021022002200110021222011 |
4 | 1033030233210001023331 |
5 | 1203132241003111404 |
6 | 15324132044451221 |
7 | 1101131520514462 |
oct | 117145744011375 |
9 | 21238080407864 |
10 | 5442521535229 |
11 | 180918457a709 |
12 | 73a969549b11 |
13 | 3062c5cb442c |
14 | 14b5c2d71669 |
15 | 9688c183604 |
hex | 4f32f9012fd |
5442521535229 has 2 divisors, whose sum is σ = 5442521535230. Its totient is φ = 5442521535228.
The previous prime is 5442521535197. The next prime is 5442521535233. The reversal of 5442521535229 is 9225351252445.
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., 4783835091204 + 658686444025 = 2187198^2 + 811595^2 .
It is a cyclic number.
It is not a de Polignac number, because 5442521535229 - 25 = 5442521535197 is a prime.
It is a super-2 number, since 2×54425215352292 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5442521535289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2721260767614 + 2721260767615.
It is an arithmetic number, because the mean of its divisors is an integer number (2721260767615).
Almost surely, 25442521535229 is an apocalyptic number.
It is an amenable number.
5442521535229 is a deficient number, since it is larger than the sum of its proper divisors (1).
5442521535229 is an equidigital number, since it uses as much as digits as its factorization.
5442521535229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4320000, while the sum is 49.
The spelling of 5442521535229 in words is "five trillion, four hundred forty-two billion, five hundred twenty-one million, five hundred thirty-five thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •