Base | Representation |
---|---|
bin | 100001100010… |
… | …000000100000 |
3 | 121112120200100 |
4 | 201202000200 |
5 | 4222240143 |
6 | 512222400 |
7 | 134466651 |
oct | 41420040 |
9 | 17476610 |
10 | 8790048 |
11 | 4a64103 |
12 | 2b3aa00 |
13 | 1a89c17 |
14 | 124b528 |
15 | b896d3 |
hex | 862020 |
8790048 has 72 divisors (see below), whose sum is σ = 26103168. Its totient is φ = 2800512.
The previous prime is 8790007. The next prime is 8790077. The reversal of 8790048 is 8400978.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 8789994 and 8790021.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5961 + ... + 7287.
It is an arithmetic number, because the mean of its divisors is an integer number (362544).
Almost surely, 28790048 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 8790048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13051584).
8790048 is an abundant number, since it is smaller than the sum of its proper divisors (17313120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8790048 is a wasteful number, since it uses less digits than its factorization.
8790048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1366 (or 1355 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
The square root of 8790048 is about 2964.8015110628. The cubic root of 8790048 is about 206.3781660697.
The spelling of 8790048 in words is "eight million, seven hundred ninety thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •