Base | Representation |
---|---|
bin | 11010110011011… |
… | …001001010000000 |
3 | 1011100011002222211 |
4 | 122303121022000 |
5 | 1410104230000 |
6 | 112342111504 |
7 | 14100134260 |
oct | 3263311200 |
9 | 1140132884 |
10 | 449680000 |
11 | 210918270 |
12 | 10671b594 |
13 | 72217153 |
14 | 43a177a0 |
15 | 297287ba |
hex | 1acd9280 |
449680000 has 320 divisors, whose sum is σ = 1414797120. Its totient is φ = 138240000.
The previous prime is 449679959. The next prime is 449680009. The reversal of 449680000 is 86944.
It is a tau number, because it is divible by the number of its divisors (320).
It is not an unprimeable number, because it can be changed into a prime (449680009) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 6159964 + ... + 6160036.
It is an arithmetic number, because the mean of its divisors is an integer number (4421241).
Almost surely, 2449680000 is an apocalyptic number.
449680000 is a gapful number since it is divisible by the number (40) 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 449680000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (707398560).
449680000 is an abundant number, since it is smaller than the sum of its proper divisors (965117120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
449680000 is an equidigital number, since it uses as much as digits as its factorization.
449680000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125 (or 98 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 31.
The square root of 449680000 is about 21205.6596219028. The cubic root of 449680000 is about 766.1277456029.
The spelling of 449680000 in words is "four hundred forty-nine million, six hundred eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •