Base | Representation |
---|---|
bin | 110110011100… |
… | …100111000000 |
3 | 222212010211011 |
4 | 312130213000 |
5 | 12123213320 |
6 | 1225530304 |
7 | 232214062 |
oct | 66344700 |
9 | 28763734 |
10 | 14272960 |
11 | 8069539 |
12 | 4943994 |
13 | 2c59750 |
14 | 1c77732 |
15 | 13be05a |
hex | d9c9c0 |
14272960 has 112 divisors (see below), whose sum is σ = 37892736. Its totient is φ = 5087232.
The previous prime is 14272957. The next prime is 14272967. The reversal of 14272960 is 6927241.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14272967) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 195484 + ... + 195556.
It is an arithmetic number, because the mean of its divisors is an integer number (338328).
Almost surely, 214272960 is an apocalyptic number.
14272960 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 14272960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18946368).
14272960 is an abundant number, since it is smaller than the sum of its proper divisors (23619776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14272960 is a wasteful number, since it uses less digits than its factorization.
14272960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150 (or 140 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 14272960 is about 3777.9571199261. The cubic root of 14272960 is about 242.5705183373.
The spelling of 14272960 in words is "fourteen million, two hundred seventy-two thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •