Base | Representation |
---|---|
bin | 1100001101010… |
… | …1011111101111 |
3 | 10120100112121020 |
4 | 3003111133233 |
5 | 101102044002 |
6 | 5025305223 |
7 | 1161150000 |
oct | 303253757 |
9 | 116315536 |
10 | 51206127 |
11 | 269a4a15 |
12 | 15195213 |
13 | a7bb3ab |
14 | 6b2d1a7 |
15 | 47672bc |
hex | 30d57ef |
51206127 has 20 divisors (see below), whose sum is σ = 79660440. Its totient is φ = 29256528.
The previous prime is 51206117. The next prime is 51206131. The reversal of 51206127 is 72160215.
It is not a de Polignac number, because 51206127 - 28 = 51205871 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51206097 and 51206106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51206117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3649 + ... + 10757.
It is an arithmetic number, because the mean of its divisors is an integer number (3983022).
Almost surely, 251206127 is an apocalyptic number.
51206127 is a deficient number, since it is larger than the sum of its proper divisors (28454313).
51206127 is an frugal number, since it uses more digits than its factorization.
51206127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7140 (or 7119 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 51206127 is about 7155.8456523321. The cubic root of 51206127 is about 371.3419180851.
The spelling of 51206127 in words is "fifty-one million, two hundred six thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •