Base | Representation |
---|---|
bin | 111101001101… |
… | …000111000000 |
3 | 1010012010220000 |
4 | 331031013000 |
5 | 13101410410 |
6 | 1331520000 |
7 | 253242624 |
oct | 75150700 |
9 | 33163800 |
10 | 16044480 |
11 | 9069501 |
12 | 5459000 |
13 | 3429b9a |
14 | 21b9184 |
15 | 161ddc0 |
hex | f4d1c0 |
16044480 has 140 divisors (see below), whose sum is σ = 57165240. Its totient is φ = 4271616.
The previous prime is 16044467. The next prime is 16044491. The reversal of 16044480 is 8444061.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 25611 + ... + 26229.
Almost surely, 216044480 is an apocalyptic number.
16044480 is a gapful number since it is divisible by the number (10) 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 16044480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28582620).
16044480 is an abundant number, since it is smaller than the sum of its proper divisors (41120760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16044480 is an equidigital number, since it uses as much as digits as its factorization.
16044480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648 (or 629 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
The square root of 16044480 is about 4005.5561411619. The cubic root of 16044480 is about 252.2174992988.
It can be divided in two parts, 1604 and 4480, that added together give a square (6084 = 782).
The spelling of 16044480 in words is "sixteen million, forty-four thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •