Base | Representation |
---|---|
bin | 10000011111001… |
… | …00001011000010 |
3 | 100122020021021000 |
4 | 20033210023002 |
5 | 240401014200 |
6 | 21420112430 |
7 | 3266341212 |
oct | 1017441302 |
9 | 318207230 |
10 | 138298050 |
11 | 7107a410 |
12 | 3a395716 |
13 | 22862787 |
14 | 14520242 |
15 | c21c300 |
hex | 83e42c2 |
138298050 has 192 divisors, whose sum is σ = 424972800. Its totient is φ = 32788800.
The previous prime is 138298049. The next prime is 138298123. The reversal of 138298050 is 50892831.
It is a junction number, because it is equal to n+sod(n) for n = 138297996 and 138298014.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 994881 + ... + 995019.
It is an arithmetic number, because the mean of its divisors is an integer number (2213400).
Almost surely, 2138298050 is an apocalyptic number.
138298050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 138298050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (212486400).
138298050 is an abundant number, since it is smaller than the sum of its proper divisors (286674750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138298050 is a wasteful number, since it uses less digits than its factorization.
138298050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238 (or 227 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The square root of 138298050 is about 11760.0191326375. The cubic root of 138298050 is about 517.1366910197.
The spelling of 138298050 in words is "one hundred thirty-eight million, two hundred ninety-eight thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •