Base | Representation |
---|---|
bin | 101111100001010101… |
… | …110011100100101111 |
3 | 11212201000222020222001 |
4 | 233201111303210233 |
5 | 1313444424331002 |
6 | 35235103433131 |
7 | 3454311204604 |
oct | 574125634457 |
9 | 155630866861 |
10 | 51025230127 |
11 | 1a704459683 |
12 | 9a802b57a7 |
13 | 4a722a1a81 |
14 | 26809686ab |
15 | 14d98aba87 |
hex | be157392f |
51025230127 has 2 divisors, whose sum is σ = 51025230128. Its totient is φ = 51025230126.
The previous prime is 51025230103. The next prime is 51025230143. The reversal of 51025230127 is 72103252015.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51025230127 is a prime.
It is a super-2 number, since 2×510252301272 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51025230095 and 51025230104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51025230727) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25512615063 + 25512615064.
It is an arithmetic number, because the mean of its divisors is an integer number (25512615064).
Almost surely, 251025230127 is an apocalyptic number.
51025230127 is a deficient number, since it is larger than the sum of its proper divisors (1).
51025230127 is an equidigital number, since it uses as much as digits as its factorization.
51025230127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4200, while the sum is 28.
The spelling of 51025230127 in words is "fifty-one billion, twenty-five million, two hundred thirty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •