Base | Representation |
---|---|
bin | 10111010000011100001111… |
… | …00101011000001100010101 |
3 | 20201002011121021222112002111 |
4 | 23220032013211120030111 |
5 | 23200404214240103203 |
6 | 300434303424311021 |
7 | 13525630411035055 |
oct | 1350160745301425 |
9 | 221064537875074 |
10 | 51142450316053 |
11 | 15328433a16908 |
12 | 589b8bb172471 |
13 | 226c935105655 |
14 | c8b444879565 |
15 | 5da4ec2ac26d |
hex | 2e8387958315 |
51142450316053 has 2 divisors, whose sum is σ = 51142450316054. Its totient is φ = 51142450316052.
The previous prime is 51142450316021. The next prime is 51142450316059. The reversal of 51142450316053 is 35061305424115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49934546007844 + 1207904308209 = 7066438^2 + 1099047^2 .
It is a cyclic number.
It is not a de Polignac number, because 51142450316053 - 25 = 51142450316021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51142450315997 and 51142450316015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51142450316059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25571225158026 + 25571225158027.
It is an arithmetic number, because the mean of its divisors is an integer number (25571225158027).
Almost surely, 251142450316053 is an apocalyptic number.
It is an amenable number.
51142450316053 is a deficient number, since it is larger than the sum of its proper divisors (1).
51142450316053 is an equidigital number, since it uses as much as digits as its factorization.
51142450316053 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 40.
The spelling of 51142450316053 in words is "fifty-one trillion, one hundred forty-two billion, four hundred fifty million, three hundred sixteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •