Base | Representation |
---|---|
bin | 10000011101111… |
… | …11001100101000 |
3 | 100121221120111202 |
4 | 20032333030220 |
5 | 240331142400 |
6 | 21412543332 |
7 | 3265140524 |
oct | 1016771450 |
9 | 317846452 |
10 | 138146600 |
11 | 70a86649 |
12 | 3a321b48 |
13 | 2280b867 |
14 | 144c0d84 |
15 | c1dc4d5 |
hex | 83bf328 |
138146600 has 48 divisors (see below), whose sum is σ = 324188700. Its totient is φ = 54743040.
The previous prime is 138146597. The next prime is 138146629. The reversal of 138146600 is 6641831.
138146600 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 53027524 + 85119076 = 7282^2 + 9226^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18632 + ... + 24968.
Almost surely, 2138146600 is an apocalyptic number.
138146600 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 138146600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162094350).
138146600 is an abundant number, since it is smaller than the sum of its proper divisors (186042100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138146600 is a wasteful number, since it uses less digits than its factorization.
138146600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6462 (or 6453 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 138146600 is about 11753.5781785803. The cubic root of 138146600 is about 516.9478501822.
The spelling of 138146600 in words is "one hundred thirty-eight million, one hundred forty-six thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •