Base | Representation |
---|---|
bin | 1100010010000… |
… | …0001111001101 |
3 | 10120221002112211 |
4 | 3010200033031 |
5 | 101141343034 |
6 | 5040030421 |
7 | 1163563354 |
oct | 304401715 |
9 | 116832484 |
10 | 51512269 |
11 | 27093a26 |
12 | 15302411 |
13 | a897843 |
14 | 6bac99b |
15 | 47c7d64 |
hex | 31203cd |
51512269 has 4 divisors (see below), whose sum is σ = 51616000. Its totient is φ = 51408540.
The previous prime is 51512267. The next prime is 51512281. The reversal of 51512269 is 96221515.
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 51512269 - 21 = 51512267 is a prime.
It is a super-2 number, since 2×515122692 = 5307027715056722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51512269.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51512267) 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, 51117 + ... + 52114.
It is an arithmetic number, because the mean of its divisors is an integer number (12904000).
Almost surely, 251512269 is an apocalyptic number.
It is an amenable number.
51512269 is a deficient number, since it is larger than the sum of its proper divisors (103731).
51512269 is a wasteful number, since it uses less digits than its factorization.
51512269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103730.
The product of its digits is 5400, while the sum is 31.
The square root of 51512269 is about 7177.2048180333. The cubic root of 51512269 is about 372.0804856296.
The spelling of 51512269 in words is "fifty-one million, five hundred twelve thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •