Base | Representation |
---|---|
bin | 1100001110000… |
… | …1101001001001 |
3 | 10120110001211222 |
4 | 3003201221021 |
5 | 101110142011 |
6 | 5030331425 |
7 | 1161445025 |
oct | 303415111 |
9 | 116401758 |
10 | 51255881 |
11 | 26a29336 |
12 | 151b9b75 |
13 | a807c31 |
14 | 6b43385 |
15 | 4776ddb |
hex | 30e1a49 |
51255881 has 4 divisors (see below), whose sum is σ = 51485952. Its totient is φ = 51025812.
The previous prime is 51255877. The next prime is 51255887. The reversal of 51255881 is 18855215.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 18855215 = 5 ⋅3771043.
It is a cyclic number.
It is not a de Polignac number, because 51255881 - 22 = 51255877 is a prime.
It is a super-2 number, since 2×512558812 = 5254330674172322, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (51255887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114701 + ... + 115146.
It is an arithmetic number, because the mean of its divisors is an integer number (12871488).
Almost surely, 251255881 is an apocalyptic number.
It is an amenable number.
51255881 is a deficient number, since it is larger than the sum of its proper divisors (230071).
51255881 is a wasteful number, since it uses less digits than its factorization.
51255881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230070.
The product of its digits is 16000, while the sum is 35.
The square root of 51255881 is about 7159.3212667124. The cubic root of 51255881 is about 371.4621495637.
The spelling of 51255881 in words is "fifty-one million, two hundred fifty-five thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •