Base | Representation |
---|---|
bin | 110111111111… |
… | …110000000000 |
3 | 1000121202212011 |
4 | 313333300000 |
5 | 12224212130 |
6 | 1242342304 |
7 | 235525015 |
oct | 67776000 |
9 | 30552764 |
10 | 14679040 |
11 | 8316642 |
12 | 4aba994 |
13 | 306c52c |
14 | 1d4170c |
15 | 144e52a |
hex | dffc00 |
14679040 has 88 divisors (see below), whose sum is σ = 36551232. Its totient is φ = 5652480.
The previous prime is 14679031. The next prime is 14679043. The reversal of 14679040 is 4097641.
It is a junction number, because it is equal to n+sod(n) for n = 14678993 and 14679011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14679043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 240610 + ... + 240670.
Almost surely, 214679040 is an apocalyptic number.
14679040 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 14679040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18275616).
14679040 is an abundant number, since it is smaller than the sum of its proper divisors (21872192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14679040 is an equidigital number, since it uses as much as digits as its factorization.
14679040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133 (or 115 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 14679040 is about 3831.3235311051. The cubic root of 14679040 is about 244.8494980149.
The spelling of 14679040 in words is "fourteen million, six hundred seventy-nine thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •