Base | Representation |
---|---|
bin | 110101100101… |
… | …111000100000 |
3 | 222102202022221 |
4 | 311211320200 |
5 | 12044030200 |
6 | 1221040424 |
7 | 230261413 |
oct | 65457040 |
9 | 28382287 |
10 | 14048800 |
11 | 7a26087 |
12 | 4856114 |
13 | 2bab6cc |
14 | 1c19b7a |
15 | 137791a |
hex | d65e20 |
14048800 has 72 divisors (see below), whose sum is σ = 36349236. Its totient is φ = 5283840.
The previous prime is 14048767. The next prime is 14048813. The reversal of 14048800 is 884041.
It can be written as a sum of positive squares in 6 ways, for example, as 11048976 + 2999824 = 3324^2 + 1732^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
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 11 ways as a sum of consecutive naturals, for example, 13084 + ... + 14116.
Almost surely, 214048800 is an apocalyptic number.
14048800 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 14048800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18174618).
14048800 is an abundant number, since it is smaller than the sum of its proper divisors (22300436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14048800 is a wasteful number, since it uses less digits than its factorization.
14048800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1070 (or 1057 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 25.
The square root of 14048800 is about 3748.1728882217. The cubic root of 14048800 is about 241.2939372488.
The spelling of 14048800 in words is "fourteen million, forty-eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •