Base | Representation |
---|---|
bin | 100100110001001000110… |
… | …0001100101111010010011 |
3 | 122220002111202211100022101 |
4 | 1021202101201211322103 |
5 | 1130243201144324301 |
6 | 14425244202221231 |
7 | 1031043025100245 |
oct | 111422141457223 |
9 | 18802452740271 |
10 | 5053323042451 |
11 | 1679114132592 |
12 | 69744b7b4817 |
13 | 2a86ac4234a8 |
14 | 136821570095 |
15 | 8b6adbbb701 |
hex | 49891865e93 |
5053323042451 has 2 divisors, whose sum is σ = 5053323042452. Its totient is φ = 5053323042450.
The previous prime is 5053323042337. The next prime is 5053323042457. The reversal of 5053323042451 is 1542403233505.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5053323042451 - 219 = 5053322518163 is a prime.
It is a super-2 number, since 2×50533230424512 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5053323042451.
It is not a weakly prime, because it can be changed into another prime (5053323042457) 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, 2526661521225 + 2526661521226.
It is an arithmetic number, because the mean of its divisors is an integer number (2526661521226).
Almost surely, 25053323042451 is an apocalyptic number.
5053323042451 is a deficient number, since it is larger than the sum of its proper divisors (1).
5053323042451 is an equidigital number, since it uses as much as digits as its factorization.
5053323042451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216000, while the sum is 37.
Adding to 5053323042451 its reverse (1542403233505), we get a palindrome (6595726275956).
The spelling of 5053323042451 in words is "five trillion, fifty-three billion, three hundred twenty-three million, forty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •