Base | Representation |
---|---|
bin | 110101111100… |
… | …110101010000 |
3 | 222121112021102 |
4 | 311330311100 |
5 | 12110032200 |
6 | 1223043532 |
7 | 231132440 |
oct | 65746520 |
9 | 28545242 |
10 | 14142800 |
11 | 7a8a771 |
12 | 48a05a8 |
13 | 2c12429 |
14 | 1c42120 |
15 | 13956d5 |
hex | d7cd50 |
14142800 has 60 divisors (see below), whose sum is σ = 38839776. Its totient is φ = 4848000.
The previous prime is 14142763. The next prime is 14142823. The reversal of 14142800 is 824141.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 275 + ... + 5325.
Almost surely, 214142800 is an apocalyptic number.
14142800 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 14142800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19419888).
14142800 is an abundant number, since it is smaller than the sum of its proper divisors (24696976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14142800 is a wasteful number, since it uses less digits than its factorization.
14142800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5076 (or 5065 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
The square root of 14142800 is about 3760.6914257886. The cubic root of 14142800 is about 241.8309043444.
Adding to 14142800 its reverse (824141), we get a palindrome (14966941).
The spelling of 14142800 in words is "fourteen million, one hundred forty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •