Base | Representation |
---|---|
bin | 110110001110… |
… | …101001111110 |
3 | 222202020102100 |
4 | 312032221332 |
5 | 12114401211 |
6 | 1224405530 |
7 | 231555333 |
oct | 66165176 |
9 | 28666370 |
10 | 14215806 |
11 | 802a600 |
12 | 49168a6 |
13 | 2c39727 |
14 | 1c6098a |
15 | 13ac156 |
hex | d8ea7e |
14215806 has 72 divisors (see below), whose sum is σ = 34732152. Its totient is φ = 4197600.
The previous prime is 14215793. The next prime is 14215837. The reversal of 14215806 is 60851241.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 14215806.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 132805 + ... + 132911.
It is an arithmetic number, because the mean of its divisors is an integer number (482391).
Almost surely, 214215806 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14215806, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17366076).
14215806 is an abundant number, since it is smaller than the sum of its proper divisors (20516346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14215806 is a wasteful number, since it uses less digits than its factorization.
14215806 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198 (or 184 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 14215806 is about 3770.3853914421. The cubic root of 14215806 is about 242.2463057008.
It can be divided in two parts, 1421 and 5806, that added together give a palindrome (7227).
The spelling of 14215806 in words is "fourteen million, two hundred fifteen thousand, eight hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •