Base | Representation |
---|---|
bin | 1100001110000… |
… | …1011011101100 |
3 | 10120110000200002 |
4 | 3003201123230 |
5 | 101110130040 |
6 | 5030323432 |
7 | 1161442355 |
oct | 303413354 |
9 | 116400602 |
10 | 51255020 |
11 | 26a28723 |
12 | 151b9578 |
13 | a80771b |
14 | 6b42d2c |
15 | 4776a15 |
hex | 30e16ec |
51255020 has 12 divisors (see below), whose sum is σ = 107635584. Its totient is φ = 20502000.
The previous prime is 51254969. The next prime is 51255031. The reversal of 51255020 is 2055215.
51255020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20), and also a Moran number because the ratio is a prime number: 2562751 = 51255020 / (5 + 1 + 2 + 5 + 5 + 0 + 2 + 0).
It is a junction number, because it is equal to n+sod(n) for n = 51254983 and 51255001.
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 3 ways as a sum of consecutive naturals, for example, 1281356 + ... + 1281395.
It is an arithmetic number, because the mean of its divisors is an integer number (8969632).
Almost surely, 251255020 is an apocalyptic number.
It is an amenable number.
51255020 is an abundant number, since it is smaller than the sum of its proper divisors (56380564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51255020 is a wasteful number, since it uses less digits than its factorization.
51255020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2562760 (or 2562758 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 20.
The square root of 51255020 is about 7159.2611350614. The cubic root of 51255020 is about 371.4600696027.
The spelling of 51255020 in words is "fifty-one million, two hundred fifty-five thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •