Base | Representation |
---|---|
bin | 111111110101000001… |
… | …1111011000101010000 |
3 | 111002210201001022211000 |
4 | 1333222003323011100 |
5 | 4221210121230102 |
6 | 142545224422000 |
7 | 12621513166020 |
oct | 1775203730520 |
9 | 432721038730 |
10 | 137070883152 |
11 | 53149a38315 |
12 | 22694917900 |
13 | cc05a98268 |
14 | 68c45d7a80 |
15 | 38739d001c |
hex | 1fea0fb150 |
137070883152 has 640 divisors, whose sum is σ = 500767948800. Its totient is φ = 35010662400.
The previous prime is 137070883141. The next prime is 137070883181. The reversal of 137070883152 is 251388070731.
It is a junction number, because it is equal to n+sod(n) for n = 137070883098 and 137070883107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 73025638 + ... + 73027514.
It is an arithmetic number, because the mean of its divisors is an integer number (782449920).
Almost surely, 2137070883152 is an apocalyptic number.
137070883152 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 137070883152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (250383974400).
137070883152 is an abundant number, since it is smaller than the sum of its proper divisors (363697065648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137070883152 is a wasteful number, since it uses less digits than its factorization.
137070883152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1992 (or 1980 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 45.
The spelling of 137070883152 in words is "one hundred thirty-seven billion, seventy million, eight hundred eighty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •