Base | Representation |
---|---|
bin | 110101101101… |
… | …011011011100 |
3 | 222111022201200 |
4 | 311231123130 |
5 | 12101022313 |
6 | 1221435500 |
7 | 230450466 |
oct | 65553334 |
9 | 28438650 |
10 | 14079708 |
11 | 7a47325 |
12 | 486bb90 |
13 | 2bbc7b6 |
14 | 1c27136 |
15 | 1381b73 |
hex | d6d6dc |
14079708 has 18 divisors (see below), whose sum is σ = 35590464. Its totient is φ = 4693224.
The previous prime is 14079697. The next prime is 14079719. The reversal of 14079708 is 80797041.
It is an interprime number because it is at equal distance from previous prime (14079697) and next prime (14079719).
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 391103 = 14079708 / (1 + 4 + 0 + 7 + 9 + 7 + 0 + 8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 195516 + ... + 195587.
It is an arithmetic number, because the mean of its divisors is an integer number (1977248).
Almost surely, 214079708 is an apocalyptic number.
14079708 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
14079708 is an abundant number, since it is smaller than the sum of its proper divisors (21510756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14079708 is a wasteful number, since it uses less digits than its factorization.
14079708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391113 (or 391108 counting only the distinct ones).
The product of its (nonzero) digits is 14112, while the sum is 36.
The square root of 14079708 is about 3752.2936985263. The cubic root of 14079708 is about 241.4707601907.
The spelling of 14079708 in words is "fourteen million, seventy-nine thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •