Base | Representation |
---|---|
bin | 10000011010000… |
… | …01100101010000 |
3 | 100120222102201110 |
4 | 20031001211100 |
5 | 240213211310 |
6 | 21353533320 |
7 | 3260565465 |
oct | 1015014520 |
9 | 316872643 |
10 | 137632080 |
11 | 70765023 |
12 | 3a114240 |
13 | 2268b601 |
14 | 143c966c |
15 | c139d20 |
hex | 8341950 |
137632080 has 160 divisors (see below), whose sum is σ = 445471488. Its totient is φ = 35123200.
The previous prime is 137632063. The next prime is 137632093. The reversal of 137632080 is 80236731.
137632080 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 698542 + ... + 698738.
Almost surely, 2137632080 is an apocalyptic number.
137632080 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 137632080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222735744).
137632080 is an abundant number, since it is smaller than the sum of its proper divisors (307839408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137632080 is a wasteful number, since it uses less digits than its factorization.
137632080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325 (or 319 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 30.
The square root of 137632080 is about 11731.6699578534. The cubic root of 137632080 is about 516.3052697579.
The spelling of 137632080 in words is "one hundred thirty-seven million, six hundred thirty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •