Base | Representation |
---|---|
bin | 10000010111001… |
… | …10110000000000 |
3 | 100120021112100220 |
4 | 20023212300000 |
5 | 240114310112 |
6 | 21341543040 |
7 | 3254456010 |
oct | 1013466000 |
9 | 316245326 |
10 | 137260032 |
11 | 70530548 |
12 | 39b74a80 |
13 | 2258b170 |
14 | 1432dc40 |
15 | c0b498c |
hex | 82e6c00 |
137260032 has 176 divisors, whose sum is σ = 451191552. Its totient is φ = 36126720.
The previous prime is 137260031. The next prime is 137260037. The reversal of 137260032 is 230062731.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 137259984 and 137260011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137260031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 279307 + ... + 279797.
Almost surely, 2137260032 is an apocalyptic number.
137260032 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 137260032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (225595776).
137260032 is an abundant number, since it is smaller than the sum of its proper divisors (313931520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137260032 is a wasteful number, since it uses less digits than its factorization.
137260032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534 (or 516 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 24.
The square root of 137260032 is about 11715.8026613630. The cubic root of 137260032 is about 515.8396232554.
The spelling of 137260032 in words is "one hundred thirty-seven million, two hundred sixty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •