Base | Representation |
---|---|
bin | 110101011010… |
… | …001000011110 |
3 | 222100022022100 |
4 | 311122020132 |
5 | 12041010140 |
6 | 1220025530 |
7 | 230001165 |
oct | 65321036 |
9 | 28308270 |
10 | 14000670 |
11 | 79a2a02 |
12 | 48322a6 |
13 | 2b92828 |
14 | 1c063dc |
15 | 1368530 |
hex | d5a21e |
14000670 has 48 divisors (see below), whose sum is σ = 36917712. Its totient is φ = 3680640.
The previous prime is 14000669. The next prime is 14000681. The reversal of 14000670 is 7600041.
14000670 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5505 + ... + 7635.
It is an arithmetic number, because the mean of its divisors is an integer number (769119).
Almost surely, 214000670 is an apocalyptic number.
14000670 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 14000670, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18458856).
14000670 is an abundant number, since it is smaller than the sum of its proper divisors (22917042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14000670 is a wasteful number, since it uses less digits than its factorization.
14000670 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2217 (or 2214 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 14000670 is about 3741.7469182188. The cubic root of 14000670 is about 241.0180711069.
The spelling of 14000670 in words is "fourteen million, six hundred seventy", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •