Base | Representation |
---|---|
bin | 111011000010101… |
… | …100000011000000 |
3 | 2120000220200111000 |
4 | 323002230003000 |
5 | 4012040413243 |
6 | 242143052000 |
7 | 33355424223 |
oct | 7302540300 |
9 | 2500820430 |
10 | 990560448 |
11 | 4691667a9 |
12 | 2378a1000 |
13 | 12a2b3757 |
14 | 957b15ba |
15 | 5be695d3 |
hex | 3b0ac0c0 |
990560448 has 112 divisors (see below), whose sum is σ = 2990961760. Its totient is φ = 321242112.
The previous prime is 990560443. The next prime is 990560449. The reversal of 990560448 is 844065099.
It is a happy number.
It is a super-2 number, since 2×9905604482 = 1962420002283921408, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (990560443) by changing a digit.
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, 56190 + ... + 71682.
Almost surely, 2990560448 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 990560448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1495480880).
990560448 is an abundant number, since it is smaller than the sum of its proper divisors (2000401312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
990560448 is a wasteful number, since it uses less digits than its factorization.
990560448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15551 (or 15535 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The square root of 990560448 is about 31473.1702883583. The cubic root of 990560448 is about 996.8435298458.
The spelling of 990560448 in words is "nine hundred ninety million, five hundred sixty thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •