Base | Representation |
---|---|
bin | 1100001010101… |
… | …0000111110110 |
3 | 10120000111220100 |
4 | 3002222013312 |
5 | 101030402340 |
6 | 5021414530 |
7 | 1156510023 |
oct | 302520766 |
9 | 116014810 |
10 | 51028470 |
11 | 26893499 |
12 | 1510a446 |
13 | a75857c |
14 | 6ac454a |
15 | 472e830 |
hex | 30aa1f6 |
51028470 has 48 divisors (see below), whose sum is σ = 134372160. Its totient is φ = 13433472.
The previous prime is 51028457. The next prime is 51028501. The reversal of 51028470 is 7482015.
51028470 is a `hidden beast` number, since 510 + 2 + 84 + 70 = 666.
51028470 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent 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 23 ways as a sum of consecutive naturals, for example, 3522 + ... + 10698.
It is an arithmetic number, because the mean of its divisors is an integer number (2799420).
Almost surely, 251028470 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51028470, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67186080).
51028470 is an abundant number, since it is smaller than the sum of its proper divisors (83343690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51028470 is a wasteful number, since it uses less digits than its factorization.
51028470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7269 (or 7266 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
The square root of 51028470 is about 7143.4214491377. The cubic root of 51028470 is about 370.9119699695.
The spelling of 51028470 in words is "fifty-one million, twenty-eight thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •