Base | Representation |
---|---|
bin | 110101101011… |
… | …1010001000000 |
3 | 1221221220021110 |
4 | 1223113101000 |
5 | 24201112304 |
6 | 2443123320 |
7 | 461140350 |
oct | 153272100 |
9 | 57856243 |
10 | 28144704 |
11 | 14983595 |
12 | 9513540 |
13 | 5aa5693 |
14 | 3a48b60 |
15 | 270e289 |
hex | 1ad7440 |
28144704 has 112 divisors (see below), whose sum is σ = 87262208. Its totient is φ = 7838208.
The previous prime is 28144691. The next prime is 28144723. The reversal of 28144704 is 40744182.
It is a tau number, because it is divible by the number of its divisors (112).
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 15 ways as a sum of consecutive naturals, for example, 57549 + ... + 58035.
Almost surely, 228144704 is an apocalyptic number.
28144704 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28144704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43631104).
28144704 is an abundant number, since it is smaller than the sum of its proper divisors (59117504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28144704 is a wasteful number, since it uses less digits than its factorization.
28144704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552 (or 542 counting only the distinct ones).
The product of its (nonzero) digits is 7168, while the sum is 30.
The square root of 28144704 is about 5305.1582445767. The cubic root of 28144704 is about 304.1811016940.
Adding to 28144704 its reverse (40744182), we get a palindrome (68888886).
The spelling of 28144704 in words is "twenty-eight million, one hundred forty-four thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •