Base | Representation |
---|---|
bin | 101111101010000110… |
… | …011000011000101111 |
3 | 11220002021111011102101 |
4 | 233222012120120233 |
5 | 1314300034302201 |
6 | 35301433235531 |
7 | 3461044236451 |
oct | 575206303057 |
9 | 156067434371 |
10 | 51172181551 |
11 | 1a77a3a9437 |
12 | 9b01562ba7 |
13 | 4a9687418a |
14 | 269629c2d1 |
15 | 14e7737d01 |
hex | bea19862f |
51172181551 has 2 divisors, whose sum is σ = 51172181552. Its totient is φ = 51172181550.
The previous prime is 51172181531. The next prime is 51172181569. The reversal of 51172181551 is 15518127115.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51172181551 - 229 = 50635310639 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51172181551.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51172181531) 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, 25586090775 + 25586090776.
It is an arithmetic number, because the mean of its divisors is an integer number (25586090776).
Almost surely, 251172181551 is an apocalyptic number.
51172181551 is a deficient number, since it is larger than the sum of its proper divisors (1).
51172181551 is an equidigital number, since it uses as much as digits as its factorization.
51172181551 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14000, while the sum is 37.
The spelling of 51172181551 in words is "fifty-one billion, one hundred seventy-two million, one hundred eighty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •