Base | Representation |
---|---|
bin | 110110100000… |
… | …000010111000 |
3 | 222212212010100 |
4 | 312200002320 |
5 | 12124141112 |
6 | 1230115400 |
7 | 232303104 |
oct | 66400270 |
9 | 28785110 |
10 | 14287032 |
11 | 8079071 |
12 | 494bb60 |
13 | 2c62c86 |
14 | 1c7c904 |
15 | 13c32dc |
hex | da00b8 |
14287032 has 96 divisors (see below), whose sum is σ = 41258880. Its totient is φ = 4458240.
The previous prime is 14287003. The next prime is 14287037. The reversal of 14287032 is 23078241.
It is a junction number, because it is equal to n+sod(n) for n = 14286987 and 14287005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14287037) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 82498 + ... + 82670.
It is an arithmetic number, because the mean of its divisors is an integer number (429780).
Almost surely, 214287032 is an apocalyptic number.
14287032 is a gapful number since it is divisible by the number (12) 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 14287032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20629440).
14287032 is an abundant number, since it is smaller than the sum of its proper divisors (26971848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14287032 is a wasteful number, since it uses less digits than its factorization.
14287032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253 (or 246 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 14287032 is about 3779.8190432877. The cubic root of 14287032 is about 242.6502105466.
The spelling of 14287032 in words is "fourteen million, two hundred eighty-seven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •