Base | Representation |
---|---|
bin | 10000100001011… |
… | …10100100110000 |
3 | 100122210202022001 |
4 | 20100232210300 |
5 | 240440242200 |
6 | 21430423344 |
7 | 3302050540 |
oct | 1020564460 |
9 | 318722261 |
10 | 138602800 |
11 | 71268376 |
12 | 3a501b54 |
13 | 2293b3bb |
14 | 1459d320 |
15 | c27c76a |
hex | 842e930 |
138602800 has 120 divisors (see below), whose sum is σ = 387475200. Its totient is φ = 46659840.
The previous prime is 138602759. The next prime is 138602801. The reversal of 138602800 is 8206831.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (138602801) 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, 164781 + ... + 165619.
It is an arithmetic number, because the mean of its divisors is an integer number (3228960).
Almost surely, 2138602800 is an apocalyptic number.
138602800 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 138602800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193737600).
138602800 is an abundant number, since it is smaller than the sum of its proper divisors (248872400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138602800 is a wasteful number, since it uses less digits than its factorization.
138602800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 923 (or 912 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 28.
The square root of 138602800 is about 11772.9690392866. The cubic root of 138602800 is about 517.5162620233.
The spelling of 138602800 in words is "one hundred thirty-eight million, six hundred two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •