Base | Representation |
---|---|
bin | 10000010110001… |
… | …00101101000100 |
3 | 100120000110002000 |
4 | 20023010231010 |
5 | 240100324310 |
6 | 21334545300 |
7 | 3253335312 |
oct | 1013045504 |
9 | 316013060 |
10 | 137120580 |
11 | 704457a3 |
12 | 39b08230 |
13 | 2253c84c |
14 | 142d50b2 |
15 | c0884c0 |
hex | 82c4b44 |
137120580 has 96 divisors (see below), whose sum is σ = 428628480. Its totient is φ = 36391680.
The previous prime is 137120579. The next prime is 137120611. The reversal of 137120580 is 85021731.
137120580 is a `hidden beast` number, since 13 + 71 + 2 + 0 + 580 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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, 145872 + ... + 146808.
It is an arithmetic number, because the mean of its divisors is an integer number (4464880).
Almost surely, 2137120580 is an apocalyptic number.
137120580 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 137120580, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214314240).
137120580 is an abundant number, since it is smaller than the sum of its proper divisors (291507900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137120580 is a wasteful number, since it uses less digits than its factorization.
137120580 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1226 (or 1218 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The square root of 137120580 is about 11709.8497001456. The cubic root of 137120580 is about 515.6648716275.
The spelling of 137120580 in words is "one hundred thirty-seven million, one hundred twenty thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •