Base | Representation |
---|---|
bin | 10000010101011… |
… | …10111101011100 |
3 | 100112211220220100 |
4 | 20022232331130 |
5 | 240040002031 |
6 | 21333021100 |
7 | 3252514536 |
oct | 1012567534 |
9 | 315756810 |
10 | 137031516 |
11 | 70394896 |
12 | 39a84790 |
13 | 2250b14b |
14 | 142b0856 |
15 | c06bde6 |
hex | 82aef5c |
137031516 has 72 divisors (see below), whose sum is σ = 363976704. Its totient is φ = 43385760.
The previous prime is 137031487. The next prime is 137031523. The reversal of 137031516 is 615130731.
137031516 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 137031516.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 137781 + ... + 138771.
It is an arithmetic number, because the mean of its divisors is an integer number (5055232).
Almost surely, 2137031516 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 137031516, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181988352).
137031516 is an abundant number, since it is smaller than the sum of its proper divisors (226945188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137031516 is a wasteful number, since it uses less digits than its factorization.
137031516 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1191 (or 1186 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 27.
The square root of 137031516 is about 11706.0461300988. The cubic root of 137031516 is about 515.5532007575.
The spelling of 137031516 in words is "one hundred thirty-seven million, thirty-one thousand, five hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •