Base | Representation |
---|---|
bin | 110110001110… |
… | …101000000000 |
3 | 222202020020200 |
4 | 312032220000 |
5 | 12114400210 |
6 | 1224405200 |
7 | 231555063 |
oct | 66165000 |
9 | 28666220 |
10 | 14215680 |
11 | 802a4a6 |
12 | 4916800 |
13 | 2c3965b |
14 | 1c608da |
15 | 13ac0c0 |
hex | d8ea00 |
14215680 has 120 divisors (see below), whose sum is σ = 49312692. Its totient is φ = 3784704.
The previous prime is 14215661. The next prime is 14215681. The reversal of 14215680 is 8651241.
It can be written as a sum of positive squares in 2 ways, for example, as 12278016 + 1937664 = 3504^2 + 1392^2 .
It is a tau number, because it is divible by the number of its divisors (120).
It is not an unprimeable number, because it can be changed into a prime (14215681) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22732 + ... + 23348.
Almost surely, 214215680 is an apocalyptic number.
14215680 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 14215680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24656346).
14215680 is an abundant number, since it is smaller than the sum of its proper divisors (35097012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14215680 is an equidigital number, since it uses as much as digits as its factorization.
14215680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646 (or 627 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 14215680 is about 3770.3686822379. The cubic root of 14215680 is about 242.2455899922.
The spelling of 14215680 in words is "fourteen million, two hundred fifteen thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •