Base | Representation |
---|---|
bin | 110101110011… |
… | …110110010000 |
3 | 222112122210110 |
4 | 311303312100 |
5 | 12102343000 |
6 | 1222201320 |
7 | 230620236 |
oct | 65636620 |
9 | 28478713 |
10 | 14106000 |
11 | 7a65057 |
12 | 4883240 |
13 | 2bcb75c |
14 | 1c32956 |
15 | 1389850 |
hex | d73d90 |
14106000 has 80 divisors (see below), whose sum is σ = 45497088. Its totient is φ = 3760000.
The previous prime is 14105957. The next prime is 14106011. The reversal of 14106000 is 60141.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4825 + ... + 7175.
Almost surely, 214106000 is an apocalyptic number.
14106000 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 14106000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22748544).
14106000 is an abundant number, since it is smaller than the sum of its proper divisors (31391088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14106000 is a wasteful number, since it uses less digits than its factorization.
14106000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2377 (or 2361 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 14106000 is about 3755.7955215906. The cubic root of 14106000 is about 241.6209716749.
Adding to 14106000 its reverse (60141), we get a palindrome (14166141).
The spelling of 14106000 in words is "fourteen million, one hundred six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •