Base | Representation |
---|---|
bin | 110111001111… |
… | …011110000000 |
3 | 1000020201120201 |
4 | 313033132000 |
5 | 12201400110 |
6 | 1234214544 |
7 | 234042322 |
oct | 67173600 |
9 | 30221521 |
10 | 14481280 |
11 | 81a1000 |
12 | 4a24454 |
13 | 3000508 |
14 | 1ccd612 |
15 | 1410b3a |
hex | dcf780 |
14481280 has 128 divisors (see below), whose sum is σ = 40318560. Its totient is φ = 4956160.
The previous prime is 14481277. The next prime is 14481281. The reversal of 14481280 is 8218441.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14481281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 851832 + ... + 851848.
Almost surely, 214481280 is an apocalyptic number.
14481280 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 14481280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20159280).
14481280 is an abundant number, since it is smaller than the sum of its proper divisors (25837280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14481280 is an equidigital number, since it uses as much as digits as its factorization.
14481280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69 (or 35 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 28.
The square root of 14481280 is about 3805.4277026374. The cubic root of 14481280 is about 243.7449632972.
The spelling of 14481280 in words is "fourteen million, four hundred eighty-one thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •