Base | Representation |
---|---|
bin | 111001010110010111110101… |
… | …0001000110010000101101101 |
3 | 2110011010011010102111102100111 |
4 | 1302230233222020302011231 |
5 | 1012104420431301201412 |
6 | 4544514035450500021 |
7 | 211153315044131545 |
oct | 16254575210620555 |
9 | 2404104112442314 |
10 | 504452132053357 |
11 | 136808a47560054 |
12 | 486b2252434611 |
13 | 1886282a49bab7 |
14 | 8c7d8834c0325 |
15 | 3d4be56de12a7 |
hex | 1cacbea23216d |
504452132053357 has 2 divisors, whose sum is σ = 504452132053358. Its totient is φ = 504452132053356.
The previous prime is 504452132053241. The next prime is 504452132053361. The reversal of 504452132053357 is 753350231254405.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 380154027056521 + 124298104996836 = 19497539^2 + 11148906^2 .
It is a cyclic number.
It is not a de Polignac number, because 504452132053357 - 219 = 504452131529069 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 504452132053357.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (504452132050357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252226066026678 + 252226066026679.
It is an arithmetic number, because the mean of its divisors is an integer number (252226066026679).
Almost surely, 2504452132053357 is an apocalyptic number.
It is an amenable number.
504452132053357 is a deficient number, since it is larger than the sum of its proper divisors (1).
504452132053357 is an equidigital number, since it uses as much as digits as its factorization.
504452132053357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560000, while the sum is 49.
The spelling of 504452132053357 in words is "five hundred four trillion, four hundred fifty-two billion, one hundred thirty-two million, fifty-three thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •