Base | Representation |
---|---|
bin | 101111111010101011… |
… | …100001110101000101 |
3 | 11220210122220211200012 |
4 | 233322223201311011 |
5 | 1320332242330023 |
6 | 35345211400005 |
7 | 3500662542011 |
oct | 577253416505 |
9 | 156718824605 |
10 | 51450355013 |
11 | 1a902425262 |
12 | 9b7a753005 |
13 | 4b0c39c365 |
14 | 26c11cd541 |
15 | 1511d84978 |
hex | bfaae1d45 |
51450355013 has 2 divisors, whose sum is σ = 51450355014. Its totient is φ = 51450355012.
The previous prime is 51450354983. The next prime is 51450355081. The reversal of 51450355013 is 31055305415.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48154791364 + 3295563649 = 219442^2 + 57407^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51450355013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51450355613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25725177506 + 25725177507.
It is an arithmetic number, because the mean of its divisors is an integer number (25725177507).
Almost surely, 251450355013 is an apocalyptic number.
It is an amenable number.
51450355013 is a deficient number, since it is larger than the sum of its proper divisors (1).
51450355013 is an equidigital number, since it uses as much as digits as its factorization.
51450355013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22500, while the sum is 32.
The spelling of 51450355013 in words is "fifty-one billion, four hundred fifty million, three hundred fifty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •