Base | Representation |
---|---|
bin | 1100010010010… |
… | …0110010001101 |
3 | 10120222001002121 |
4 | 3010210302031 |
5 | 101142442033 |
6 | 5040252541 |
7 | 1164001561 |
oct | 304446215 |
9 | 116861077 |
10 | 51530893 |
11 | 270a6a17 |
12 | 15311151 |
13 | a8a316b |
14 | 6bb56a1 |
15 | 47cd62d |
hex | 3124c8d |
51530893 has 8 divisors (see below), whose sum is σ = 55592568. Its totient is φ = 47583744.
The previous prime is 51530887. The next prime is 51530917. The reversal of 51530893 is 39803515.
It can be written as a sum of positive squares in 4 ways, for example, as 32285124 + 19245769 = 5682^2 + 4387^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51530893 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51530803) 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 7 ways as a sum of consecutive naturals, for example, 27696 + ... + 29497.
It is an arithmetic number, because the mean of its divisors is an integer number (6949071).
Almost surely, 251530893 is an apocalyptic number.
51530893 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
51530893 is a deficient number, since it is larger than the sum of its proper divisors (4061675).
51530893 is a wasteful number, since it uses less digits than its factorization.
51530893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57263.
The product of its (nonzero) digits is 16200, while the sum is 34.
The square root of 51530893 is about 7178.5021418120. The cubic root of 51530893 is about 372.1253214984.
The spelling of 51530893 in words is "fifty-one million, five hundred thirty thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •