Base | Representation |
---|---|
bin | 10000011010011… |
… | …10000011010000 |
3 | 100121002000210000 |
4 | 20031032003100 |
5 | 240221330102 |
6 | 21355010000 |
7 | 3261200415 |
oct | 1015160320 |
9 | 317060700 |
10 | 137683152 |
11 | 7079a432 |
12 | 3a139900 |
13 | 226a8929 |
14 | 1440010c |
15 | c14a01c |
hex | 834e0d0 |
137683152 has 200 divisors, whose sum is σ = 432115200. Its totient is φ = 42197760.
The previous prime is 137683141. The next prime is 137683157. The reversal of 137683152 is 251386731.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137683157) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 923974 + ... + 924122.
It is an arithmetic number, because the mean of its divisors is an integer number (2160576).
Almost surely, 2137683152 is an apocalyptic number.
137683152 is a gapful number since it is divisible by the number (12) 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 137683152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (216057600).
137683152 is an abundant number, since it is smaller than the sum of its proper divisors (294432048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137683152 is a wasteful number, since it uses less digits than its factorization.
137683152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 223 (or 208 counting only the distinct ones).
The product of its digits is 30240, while the sum is 36.
The square root of 137683152 is about 11733.8464281752. The cubic root of 137683152 is about 516.3691247395.
The spelling of 137683152 in words is "one hundred thirty-seven million, six hundred eighty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •