Base | Representation |
---|---|
bin | 1100001010100… |
… | …1001001101001 |
3 | 10120000022102220 |
4 | 3002221021221 |
5 | 101030240424 |
6 | 5021344253 |
7 | 1156462305 |
oct | 302511151 |
9 | 116008386 |
10 | 51024489 |
11 | 268904aa |
12 | 15108089 |
13 | a756809 |
14 | 6ac2d05 |
15 | 472d579 |
hex | 30a9269 |
51024489 has 4 divisors (see below), whose sum is σ = 68032656. Its totient is φ = 34016324.
The previous prime is 51024473. The next prime is 51024521. The reversal of 51024489 is 98442015.
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.
It is a cyclic number.
It is not a de Polignac number, because 51024489 - 24 = 51024473 is a prime.
It is a super-2 number, since 2×510244892 = 5206996955422242, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (51024689) 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, 8504079 + ... + 8504084.
It is an arithmetic number, because the mean of its divisors is an integer number (17008164).
Almost surely, 251024489 is an apocalyptic number.
It is an amenable number.
51024489 is a deficient number, since it is larger than the sum of its proper divisors (17008167).
51024489 is a wasteful number, since it uses less digits than its factorization.
51024489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17008166.
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 51024489 is about 7143.1427957167. The cubic root of 51024489 is about 370.9023241192.
It can be divided in two parts, 5102 and 4489, that added together give a triangular number (9591 = T138).
The spelling of 51024489 in words is "fifty-one million, twenty-four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •