Base | Representation |
---|---|
bin | 1100011001110… |
… | …00111011011000 |
3 | 21020202220001211 |
4 | 12030320323120 |
5 | 203113322300 |
6 | 14153552504 |
7 | 2402226013 |
oct | 614707330 |
9 | 236686054 |
10 | 104042200 |
11 | 53802499 |
12 | 2aa15734 |
13 | 1872a642 |
14 | db6437a |
15 | 92024ba |
hex | 6338ed8 |
104042200 has 96 divisors (see below), whose sum is σ = 253733760. Its totient is φ = 39628800.
The previous prime is 104042177. The next prime is 104042203. The reversal of 104042200 is 2240401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104042203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 601314 + ... + 601486.
It is an arithmetic number, because the mean of its divisors is an integer number (2643060).
Almost surely, 2104042200 is an apocalyptic number.
104042200 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 104042200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126866880).
104042200 is an abundant number, since it is smaller than the sum of its proper divisors (149691560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104042200 is a wasteful number, since it uses less digits than its factorization.
104042200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317 (or 308 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 13.
The square root of 104042200 is about 10200.1078425672. The cubic root of 104042200 is about 470.3305355607.
Adding to 104042200 its reverse (2240401), we get a palindrome (106282601).
The spelling of 104042200 in words is "one hundred four million, forty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •