Base | Representation |
---|---|
bin | 10000011010000… |
… | …11011110010000 |
3 | 100120222211100021 |
4 | 20031003132100 |
5 | 240213433244 |
6 | 21354033224 |
7 | 3260630200 |
oct | 1015033620 |
9 | 316884307 |
10 | 137639824 |
11 | 7076a923 |
12 | 3a118814 |
13 | 22691caa |
14 | 143cc400 |
15 | c13c284 |
hex | 8343790 |
137639824 has 45 divisors (see below), whose sum is σ = 310958427. Its totient is φ = 58847712.
The previous prime is 137639807. The next prime is 137639833. The reversal of 137639824 is 428936731.
The square root of 137639824 is 11732.
It is a perfect power (a square), and thus also a powerful number.
137639824 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Duffinian 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 8 ways as a sum of consecutive naturals, for example, 328287 + ... + 328705.
Almost surely, 2137639824 is an apocalyptic number.
137639824 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
137639824 is the 11732-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 137639824
137639824 is an abundant number, since it is smaller than the sum of its proper divisors (173318603).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137639824 is an frugal number, since it uses more digits than its factorization.
137639824 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 860 (or 428 counting only the distinct ones).
The product of its digits is 217728, while the sum is 43.
The cubic root of 137639824 is about 516.3149530455.
The spelling of 137639824 in words is "one hundred thirty-seven million, six hundred thirty-nine thousand, eight hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •