Base | Representation |
---|---|
bin | 110100111111010… |
… | …001101000000000 |
3 | 2021221211000011101 |
4 | 310333101220000 |
5 | 3310041034441 |
6 | 224114224144 |
7 | 31013253004 |
oct | 6477215000 |
9 | 2257730141 |
10 | 889002496 |
11 | 416900808 |
12 | 209885054 |
13 | 112245aa5 |
14 | 860d6704 |
15 | 530a8231 |
hex | 34fd1a00 |
889002496 has 60 divisors (see below), whose sum is σ = 1819837206. Its totient is φ = 433704960.
The previous prime is 889002481. The next prime is 889002523. The reversal of 889002496 is 694200988.
It can be written as a sum of positive squares in 3 ways, for example, as 293642496 + 595360000 = 17136^2 + 24400^2 .
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
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 5 ways as a sum of consecutive naturals, for example, 4911526 + ... + 4911706.
Almost surely, 2889002496 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 889002496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (909918603).
889002496 is an abundant number, since it is smaller than the sum of its proper divisors (930834710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
889002496 is an frugal number, since it uses more digits than its factorization.
889002496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433 (or 236 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 46.
The square root of 889002496 is about 29816.1448882984. The cubic root of 889002496 is about 961.5406742451.
The spelling of 889002496 in words is "eight hundred eighty-nine million, two thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •