Base | Representation |
---|---|
bin | 110110010011… |
… | …0011100001000 |
3 | 1222120101010102 |
4 | 1230212130020 |
5 | 24242002000 |
6 | 2454104532 |
7 | 463661000 |
oct | 154463410 |
9 | 58511112 |
10 | 28469000 |
11 | 150851aa |
12 | 964b148 |
13 | 5b8a181 |
14 | 3ad1000 |
15 | 27753d5 |
hex | 1b26708 |
28469000 has 128 divisors (see below), whose sum is σ = 78624000. Its totient is φ = 9643200.
The previous prime is 28468949. The next prime is 28469017. The reversal of 28469000 is 96482.
It is a super-2 number, since 2×284690002 = 1620967922000000, which contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 342959 + ... + 343041.
It is an arithmetic number, because the mean of its divisors is an integer number (614250).
Almost surely, 228469000 is an apocalyptic number.
28469000 is a gapful number since it is divisible by the number (20) 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 28469000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39312000).
28469000 is an abundant number, since it is smaller than the sum of its proper divisors (50155000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28469000 is an equidigital number, since it uses as much as digits as its factorization.
28469000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125 (or 97 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 28469000 is about 5335.6349200447. The cubic root of 28469000 is about 305.3449470018.
The spelling of 28469000 in words is "twenty-eight million, four hundred sixty-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •