Base | Representation |
---|---|
bin | 11010101110110… |
… | …111101110111000 |
3 | 1011020220212211011 |
4 | 122232313232320 |
5 | 1404303311040 |
6 | 112300443304 |
7 | 14054066125 |
oct | 3256675670 |
9 | 1136825734 |
10 | 448494520 |
11 | 210188631 |
12 | 106249534 |
13 | 71bc0696 |
14 | 437c974c |
15 | 295923ea |
hex | 1abb7bb8 |
448494520 has 16 divisors (see below), whose sum is σ = 1009112760. Its totient is φ = 179397792.
The previous prime is 448494517. The next prime is 448494547. The reversal of 448494520 is 25494844.
It is a super-2 number, since 2×4484945202 = 402294668940060800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40), and also a Moran number because the ratio is a prime number: 11212363 = 448494520 / (4 + 4 + 8 + 4 + 9 + 4 + 5 + 2 + 0).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5606142 + ... + 5606221.
Almost surely, 2448494520 is an apocalyptic number.
448494520 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
448494520 is an abundant number, since it is smaller than the sum of its proper divisors (560618240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
448494520 is a wasteful number, since it uses less digits than its factorization.
448494520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11212374 (or 11212370 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 40.
The square root of 448494520 is about 21177.6892034990. The cubic root of 448494520 is about 765.4539120586.
The spelling of 448494520 in words is "four hundred forty-eight million, four hundred ninety-four thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •