Base | Representation |
---|---|
bin | 1000000000110001001… |
… | …0010000101110010000 |
3 | 111011021201110220012002 |
4 | 2000030102100232100 |
5 | 4223344114122102 |
6 | 143122215253132 |
7 | 12641654523605 |
oct | 2001422205620 |
9 | 434251426162 |
10 | 137645067152 |
11 | 5341406324a |
12 | 2281507a1a8 |
13 | cc97a253c8 |
14 | 693a9806ac |
15 | 38a90ed902 |
hex | 200c490b90 |
137645067152 has 80 divisors (see below), whose sum is σ = 283492145520. Its totient is φ = 64518488064.
The previous prime is 137645067127. The next prime is 137645067223. The reversal of 137645067152 is 251760546731.
It can be written as a sum of positive squares in 8 ways, for example, as 23606478736 + 114038588416 = 153644^2 + 337696^2 .
It is a super-2 number, since 2×1376450671522 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 137645067097 and 137645067106.
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 15 ways as a sum of consecutive naturals, for example, 111272678 + ... + 111273914.
It is an arithmetic number, because the mean of its divisors is an integer number (3543651819).
Almost surely, 2137645067152 is an apocalyptic number.
It is an amenable number.
137645067152 is an abundant number, since it is smaller than the sum of its proper divisors (145847078368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137645067152 is a wasteful number, since it uses less digits than its factorization.
137645067152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2548 (or 2542 counting only the distinct ones).
The product of its (nonzero) digits is 1058400, while the sum is 47.
The spelling of 137645067152 in words is "one hundred thirty-seven billion, six hundred forty-five million, sixty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •