Base | Representation |
---|---|
bin | 111111110011101010… |
… | …1111111101100000000 |
3 | 111002200112020220100020 |
4 | 1333213111333230000 |
5 | 4221111433221320 |
6 | 142540515253440 |
7 | 12620420511240 |
oct | 1774725775400 |
9 | 432615226306 |
10 | 137025288960 |
11 | 5312622676a |
12 | 226815aa280 |
13 | cbc94c3351 |
14 | 68bc529b20 |
15 | 386e9c5940 |
hex | 1fe757fb00 |
137025288960 has 288 divisors, whose sum is σ = 510788339712. Its totient is φ = 30653399040.
The previous prime is 137025288943. The next prime is 137025288997. The reversal of 137025288960 is 69882520731.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1209130 + ... + 1317590.
It is an arithmetic number, because the mean of its divisors is an integer number (1773570624).
Almost surely, 2137025288960 is an apocalyptic number.
137025288960 is a gapful number since it is divisible by the number (10) 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 137025288960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (255394169856).
137025288960 is an abundant number, since it is smaller than the sum of its proper divisors (373763050752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137025288960 is a wasteful number, since it uses less digits than its factorization.
137025288960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108539 (or 108525 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 51.
The spelling of 137025288960 in words is "one hundred thirty-seven billion, twenty-five million, two hundred eighty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •