Base | Representation |
---|---|
bin | 101111111101111011… |
… | …100100100100001001 |
3 | 11220221110112121120212 |
4 | 233331323210210021 |
5 | 1320440223022134 |
6 | 35354440330505 |
7 | 3502224234323 |
oct | 577573444411 |
9 | 156843477525 |
10 | 51504892169 |
11 | 1a930194895 |
12 | 9b94a73a35 |
13 | 4b1a785973 |
14 | 26c8548613 |
15 | 1516a58bce |
hex | bfdee4909 |
51504892169 has 2 divisors, whose sum is σ = 51504892170. Its totient is φ = 51504892168.
The previous prime is 51504892139. The next prime is 51504892189. The reversal of 51504892169 is 96129840515.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50405638144 + 1099254025 = 224512^2 + 33155^2 .
It is a cyclic number.
It is not a de Polignac number, because 51504892169 - 28 = 51504891913 is a prime.
It is a super-2 number, since 2×515048921692 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51504892139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25752446084 + 25752446085.
It is an arithmetic number, because the mean of its divisors is an integer number (25752446085).
Almost surely, 251504892169 is an apocalyptic number.
It is an amenable number.
51504892169 is a deficient number, since it is larger than the sum of its proper divisors (1).
51504892169 is an equidigital number, since it uses as much as digits as its factorization.
51504892169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 777600, while the sum is 50.
The spelling of 51504892169 in words is "fifty-one billion, five hundred four million, eight hundred ninety-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •