Base | Representation |
---|---|
bin | 110110111001… |
… | …001101100000 |
3 | 1000002002112010 |
4 | 312321031200 |
5 | 12140440422 |
6 | 1232232520 |
7 | 233212452 |
oct | 66711540 |
9 | 30062463 |
10 | 14390112 |
11 | 8139560 |
12 | 499b740 |
13 | 2c9ab79 |
14 | 1ca82d2 |
15 | 13e3b0c |
hex | db9360 |
14390112 has 48 divisors (see below), whose sum is σ = 41211072. Its totient is φ = 4360320.
The previous prime is 14390093. The next prime is 14390113. The reversal of 14390112 is 21109341.
14390112 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14390113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5758 + ... + 7869.
It is an arithmetic number, because the mean of its divisors is an integer number (858564).
Almost surely, 214390112 is an apocalyptic number.
14390112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14390112 is an abundant number, since it is smaller than the sum of its proper divisors (26820960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14390112 is a wasteful number, since it uses less digits than its factorization.
14390112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13651 (or 13643 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 14390112 is about 3793.4301100719. The cubic root of 14390112 is about 243.2323811339.
Adding to 14390112 its reverse (21109341), we get a palindrome (35499453).
The spelling of 14390112 in words is "fourteen million, three hundred ninety thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •