Base | Representation |
---|---|
bin | 1100010010000… |
… | …0001110110101 |
3 | 10120221002111221 |
4 | 3010200032311 |
5 | 101141342440 |
6 | 5040030341 |
7 | 1163563321 |
oct | 304401665 |
9 | 116832457 |
10 | 51512245 |
11 | 27093a04 |
12 | 153023b1 |
13 | a897825 |
14 | 6bac981 |
15 | 47c7d4a |
hex | 31203b5 |
51512245 has 8 divisors (see below), whose sum is σ = 61855416. Its totient is φ = 41182656.
The previous prime is 51512233. The next prime is 51512267. The reversal of 51512245 is 54221515.
It can be written as a sum of positive squares in 4 ways, for example, as 15295921 + 36216324 = 3911^2 + 6018^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51512245 - 27 = 51512117 is a prime.
It is a super-2 number, since 2×515122452 = 5307022769880050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent 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 7 ways as a sum of consecutive naturals, for example, 9219 + ... + 13711.
It is an arithmetic number, because the mean of its divisors is an integer number (7731927).
Almost surely, 251512245 is an apocalyptic number.
It is an amenable number.
51512245 is a deficient number, since it is larger than the sum of its proper divisors (10343171).
51512245 is a wasteful number, since it uses less digits than its factorization.
51512245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6791.
The product of its digits is 2000, while the sum is 25.
The square root of 51512245 is about 7177.2031460730. The cubic root of 51512245 is about 372.0804278445.
It can be divided in two parts, 5151 and 2245, that added together give a square (7396 = 862).
The spelling of 51512245 in words is "fifty-one million, five hundred twelve thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •