Base | Representation |
---|---|
bin | 10000010111100… |
… | …01100011010000 |
3 | 100120100210001102 |
4 | 20023301203100 |
5 | 240122214042 |
6 | 21342523532 |
7 | 3255032000 |
oct | 1013614320 |
9 | 316323042 |
10 | 137304272 |
11 | 70560806 |
12 | 39b965a8 |
13 | 225a5341 |
14 | 14342000 |
15 | c0c2b32 |
hex | 82f18d0 |
137304272 has 80 divisors (see below), whose sum is σ = 314265600. Its totient is φ = 58084992.
The previous prime is 137304263. The next prime is 137304281. The reversal of 137304272 is 272403731.
It is an interprime number because it is at equal distance from previous prime (137304263) and next prime (137304281).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 696878 + ... + 697074.
It is an arithmetic number, because the mean of its divisors is an integer number (3928320).
Almost surely, 2137304272 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 137304272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157132800).
137304272 is an abundant number, since it is smaller than the sum of its proper divisors (176961328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137304272 is a wasteful number, since it uses less digits than its factorization.
137304272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 353 (or 333 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 29.
The square root of 137304272 is about 11717.6905574435. The cubic root of 137304272 is about 515.8950370402.
The spelling of 137304272 in words is "one hundred thirty-seven million, three hundred four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •