Base | Representation |
---|---|
bin | 1100001100000… |
… | …1011111110001 |
3 | 10120012101020020 |
4 | 3003001133301 |
5 | 101041433314 |
6 | 5023434053 |
7 | 1160356113 |
oct | 303013761 |
9 | 116171206 |
10 | 51124209 |
11 | 26949414 |
12 | 15155929 |
13 | a790016 |
14 | 6b0b3b3 |
15 | 474cda9 |
hex | 30c17f1 |
51124209 has 4 divisors (see below), whose sum is σ = 68165616. Its totient is φ = 34082804.
The previous prime is 51124207. The next prime is 51124217. The reversal of 51124209 is 90242115.
51124209 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 51124209 - 21 = 51124207 is a prime.
It is a super-2 number, since 2×511242092 = 5227369491751362, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51124207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8520699 + ... + 8520704.
It is an arithmetic number, because the mean of its divisors is an integer number (17041404).
Almost surely, 251124209 is an apocalyptic number.
It is an amenable number.
51124209 is a deficient number, since it is larger than the sum of its proper divisors (17041407).
51124209 is a wasteful number, since it uses less digits than its factorization.
51124209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17041406.
The product of its (nonzero) digits is 720, while the sum is 24.
The square root of 51124209 is about 7150.1195094907. The cubic root of 51124209 is about 371.1437919043.
The spelling of 51124209 in words is "fifty-one million, one hundred twenty-four thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •