Base | Representation |
---|---|
bin | 10000010111000… |
… | …01110100000000 |
3 | 100120020111121212 |
4 | 20023201310000 |
5 | 240113133213 |
6 | 21341305252 |
7 | 3254343026 |
oct | 1013416400 |
9 | 316214555 |
10 | 137239808 |
11 | 70517332 |
12 | 39b65228 |
13 | 22581bb4 |
14 | 14326716 |
15 | c0ad9a8 |
hex | 82e1d00 |
137239808 has 36 divisors (see below), whose sum is σ = 281366820. Its totient is φ = 66760704.
The previous prime is 137239807. The next prime is 137239819. The reversal of 137239808 is 808932731.
It can be written as a sum of positive squares in 2 ways, for example, as 72726784 + 64513024 = 8528^2 + 8032^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137239801) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2228 + ... + 16716.
It is an arithmetic number, because the mean of its divisors is an integer number (7815745).
Almost surely, 2137239808 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 137239808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140683410).
137239808 is an abundant number, since it is smaller than the sum of its proper divisors (144127012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137239808 is an equidigital number, since it uses as much as digits as its factorization.
137239808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14542 (or 14528 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 41.
The square root of 137239808 is about 11714.9395218243. The cubic root of 137239808 is about 515.8142872738.
The spelling of 137239808 in words is "one hundred thirty-seven million, two hundred thirty-nine thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •