Base | Representation |
---|---|
bin | 110110000100… |
… | …0011100100000 |
3 | 1222100010121012 |
4 | 1230020130200 |
5 | 24224034034 |
6 | 2451320052 |
7 | 462636551 |
oct | 154103440 |
9 | 58303535 |
10 | 28346144 |
11 | 15000972 |
12 | 95b0028 |
13 | 5b46288 |
14 | 3a9c328 |
15 | 274dcce |
hex | 1b08720 |
28346144 has 48 divisors (see below), whose sum is σ = 58174200. Its totient is φ = 13584384.
The previous prime is 28346113. The next prime is 28346147. The reversal of 28346144 is 44164382.
It can be written as a sum of positive squares in 4 ways, for example, as 19465744 + 8880400 = 4412^2 + 2980^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 28346144.
It is not an unprimeable number, because it can be changed into a prime (28346147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 105242 + ... + 105510.
Almost surely, 228346144 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28346144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29087100).
28346144 is an abundant number, since it is smaller than the sum of its proper divisors (29828056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28346144 is a wasteful number, since it uses less digits than its factorization.
28346144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405 (or 397 counting only the distinct ones).
The product of its digits is 18432, while the sum is 32.
The square root of 28346144 is about 5324.1096908309. The cubic root of 28346144 is about 304.9050819931.
The spelling of 28346144 in words is "twenty-eight million, three hundred forty-six thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •