Base | Representation |
---|---|
bin | 110101110000… |
… | …110111000000 |
3 | 222112001000010 |
4 | 311300313000 |
5 | 12102000020 |
6 | 1222024520 |
7 | 230536452 |
oct | 65606700 |
9 | 28461003 |
10 | 14093760 |
11 | 7a5693a |
12 | 4878140 |
13 | 2bc6005 |
14 | 1c2c2d2 |
15 | 1385de0 |
hex | d70dc0 |
14093760 has 112 divisors (see below), whose sum is σ = 45756576. Its totient is φ = 3674112.
The previous prime is 14093759. The next prime is 14093767. The reversal of 14093760 is 6739041.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14093767) 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, 50742 + ... + 51018.
Almost surely, 214093760 is an apocalyptic number.
14093760 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 14093760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22878288).
14093760 is an abundant number, since it is smaller than the sum of its proper divisors (31662816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14093760 is a wasteful number, since it uses less digits than its factorization.
14093760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350 (or 340 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 30.
The square root of 14093760 is about 3754.1656862744. The cubic root of 14093760 is about 241.5510653345.
The spelling of 14093760 in words is "fourteen million, ninety-three thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •