Base | Representation |
---|---|
bin | 1100001101011… |
… | …1100011010001 |
3 | 10120100222011000 |
4 | 3003113203101 |
5 | 101102331140 |
6 | 5025412213 |
7 | 1161213354 |
oct | 303274321 |
9 | 116328130 |
10 | 51214545 |
11 | 26a00278 |
12 | 1519a069 |
13 | a7c2185 |
14 | 6b3229b |
15 | 4769a30 |
hex | 30d78d1 |
51214545 has 32 divisors (see below), whose sum is σ = 92010240. Its totient is φ = 27025920.
The previous prime is 51214529. The next prime is 51214561. The reversal of 51214545 is 54541215.
51214545 is a `hidden beast` number, since 512 + 145 + 4 + 5 = 666.
51214545 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (51214529) and next prime (51214561).
It is not a de Polignac number, because 51214545 - 24 = 51214529 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 11140 + ... + 15050.
It is an arithmetic number, because the mean of its divisors is an integer number (2875320).
Almost surely, 251214545 is an apocalyptic number.
It is an amenable number.
51214545 is a deficient number, since it is larger than the sum of its proper divisors (40795695).
51214545 is a wasteful number, since it uses less digits than its factorization.
51214545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4022 (or 4016 counting only the distinct ones).
The product of its digits is 4000, while the sum is 27.
The square root of 51214545 is about 7156.4338185999. The cubic root of 51214545 is about 371.3622658128.
The spelling of 51214545 in words is "fifty-one million, two hundred fourteen thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •