Base | Representation |
---|---|
bin | 1100001011101… |
… | …0000100011001 |
3 | 10120010211111102 |
4 | 3002322010121 |
5 | 101040000120 |
6 | 5023041145 |
7 | 1160201321 |
oct | 302720431 |
9 | 116124442 |
10 | 51093785 |
11 | 26928576 |
12 | 151401b5 |
13 | a77c212 |
14 | 6b00281 |
15 | 4743d75 |
hex | 30ba119 |
51093785 has 4 divisors (see below), whose sum is σ = 61312548. Its totient is φ = 40875024.
The previous prime is 51093773. The next prime is 51093821. The reversal of 51093785 is 58739015.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 58739015 = 5 ⋅11747803.
It can be written as a sum of positive squares in 2 ways, for example, as 6431296 + 44662489 = 2536^2 + 6683^2 .
It is a cyclic number.
It is not a de Polignac number, because 51093785 - 24 = 51093769 is a prime.
It is a super-2 number, since 2×510937852 = 5221149731252450, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
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, 5109374 + ... + 5109383.
It is an arithmetic number, because the mean of its divisors is an integer number (15328137).
Almost surely, 251093785 is an apocalyptic number.
It is an amenable number.
51093785 is a deficient number, since it is larger than the sum of its proper divisors (10218763).
51093785 is a wasteful number, since it uses less digits than its factorization.
51093785 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10218762.
The product of its (nonzero) digits is 37800, while the sum is 38.
The square root of 51093785 is about 7147.9916759884. The cubic root of 51093785 is about 371.0701547790.
The spelling of 51093785 in words is "fifty-one million, ninety-three thousand, seven hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •