Base | Representation |
---|---|
bin | 10000100010011… |
… | …00011101010000 |
3 | 100200000222012101 |
4 | 20101030131100 |
5 | 241003201300 |
6 | 21433210144 |
7 | 3303100435 |
oct | 1021143520 |
9 | 320028171 |
10 | 138725200 |
11 | 71341329 |
12 | 3a560954 |
13 | 22982023 |
14 | 145d1b8c |
15 | c2a3b6a |
hex | 844c750 |
138725200 has 90 divisors (see below), whose sum is σ = 342698366. Its totient is φ = 53963520.
The previous prime is 138725189. The next prime is 138725231. The reversal of 138725200 is 2527831.
It can be written as a sum of positive squares in 3 ways, for example, as 2862864 + 135862336 = 1692^2 + 11656^2 .
It is a super-2 number, since 2×1387252002 = 38489362230080000, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 883522 + ... + 883678.
Almost surely, 2138725200 is an apocalyptic number.
138725200 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 138725200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171349183).
138725200 is an abundant number, since it is smaller than the sum of its proper divisors (203973166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138725200 is a wasteful number, since it uses less digits than its factorization.
138725200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 269 (or 211 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 28.
The square root of 138725200 is about 11778.1662409732. The cubic root of 138725200 is about 517.6685565736.
The spelling of 138725200 in words is "one hundred thirty-eight million, seven hundred twenty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •