Base | Representation |
---|---|
bin | 110101101010… |
… | …010110010010 |
3 | 222110200102100 |
4 | 311222112102 |
5 | 12100121330 |
6 | 1221301230 |
7 | 230365632 |
oct | 65522622 |
9 | 28420370 |
10 | 14067090 |
11 | 7a388a4 |
12 | 4864816 |
13 | 2bb6b2b |
14 | 1c226c2 |
15 | 137d060 |
hex | d6a592 |
14067090 has 48 divisors (see below), whose sum is σ = 36855000. Its totient is φ = 3722496.
The previous prime is 14067083. The next prime is 14067091. The reversal of 14067090 is 9076041.
14067090 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 11471769 + 2595321 = 3387^2 + 1611^2 .
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (14067091) 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, 12886 + ... + 13934.
Almost surely, 214067090 is an apocalyptic number.
14067090 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14067090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18427500).
14067090 is an abundant number, since it is smaller than the sum of its proper divisors (22787910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14067090 is a wasteful number, since it uses less digits than its factorization.
14067090 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1211 (or 1208 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 14067090 is about 3750.6119500689. The cubic root of 14067090 is about 241.3986046060.
The spelling of 14067090 in words is "fourteen million, sixty-seven thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •