Base | Representation |
---|---|
bin | 10000011101000… |
… | …11000001100000 |
3 | 100121201201012200 |
4 | 20032203001200 |
5 | 240313444300 |
6 | 21410253200 |
7 | 3264150216 |
oct | 1016430140 |
9 | 317651180 |
10 | 138031200 |
11 | 70a0797a |
12 | 3a287200 |
13 | 2279b188 |
14 | 14490cb6 |
15 | c1b8200 |
hex | 83a3060 |
138031200 has 216 divisors, whose sum is σ = 512857800. Its totient is φ = 34836480.
The previous prime is 138031183. The next prime is 138031207. The reversal of 138031200 is 2130831.
It is a super-2 number, since 2×1380312002 = 38105224346880000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138031207) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 136296 + ... + 137304.
Almost surely, 2138031200 is an apocalyptic number.
138031200 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 138031200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (256428900).
138031200 is an abundant number, since it is smaller than the sum of its proper divisors (374826600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138031200 is a wasteful number, since it uses less digits than its factorization.
138031200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1054 (or 1038 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 138031200 is about 11748.6680096086. The cubic root of 138031200 is about 516.8038669048.
The spelling of 138031200 in words is "one hundred thirty-eight million, thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •