Base | Representation |
---|---|
bin | 1100010000100… |
… | …1110100011111 |
3 | 10120202102121000 |
4 | 3010021310133 |
5 | 101130423242 |
6 | 5034041343 |
7 | 1163031561 |
oct | 304116437 |
9 | 116672530 |
10 | 51420447 |
11 | 27030a41 |
12 | 15279253 |
13 | a864b00 |
14 | 6b87331 |
15 | 47aaa4c |
hex | 3109d1f |
51420447 has 48 divisors (see below), whose sum is σ = 84326400. Its totient is φ = 30944160.
The previous prime is 51420443. The next prime is 51420449. The reversal of 51420447 is 74402415.
51420447 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 51420447 - 22 = 51420443 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 51420447.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51420443) 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 47 ways as a sum of consecutive naturals, for example, 269122 + ... + 269312.
It is an arithmetic number, because the mean of its divisors is an integer number (1756800).
Almost surely, 251420447 is an apocalyptic number.
51420447 is a deficient number, since it is larger than the sum of its proper divisors (32905953).
51420447 is a wasteful number, since it uses less digits than its factorization.
51420447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285 (or 266 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 27.
The square root of 51420447 is about 7170.8051849147. The cubic root of 51420447 is about 371.8592729926.
The spelling of 51420447 in words is "fifty-one million, four hundred twenty thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •