Base | Representation |
---|---|
bin | 11111001111100011111110… |
… | …111100010011100110010000 |
3 | 200000112011022110210212020220 |
4 | 133033203332330103212100 |
5 | 121002301331431033113 |
6 | 1204124432555033040 |
7 | 40641314626562523 |
oct | 3717437674234620 |
9 | 600464273725226 |
10 | 137408870955408 |
11 | 3a867858459a78 |
12 | 134b2914a3b780 |
13 | 5b897a7329490 |
14 | 25d08a67babba |
15 | 10d44c037c523 |
hex | 7cf8fef13990 |
137408870955408 has 160 divisors (see below), whose sum is σ = 394622681198592. Its totient is φ = 40914487411200.
The previous prime is 137408870955361. The next prime is 137408870955431. The reversal of 137408870955408 is 804559078804731.
It is a Cunningham number, because it is equal to 117221532-1.
It is a super-3 number, since 3×1374088709554083 (a number of 43 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 726678891 + ... + 726867957.
Almost surely, 2137408870955408 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 137408870955408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (197311340599296).
137408870955408 is an abundant number, since it is smaller than the sum of its proper divisors (257213810243184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137408870955408 is a wasteful number, since it uses less digits than its factorization.
137408870955408 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 226693 (or 226687 counting only the distinct ones).
The product of its (nonzero) digits is 270950400, while the sum is 69.
The spelling of 137408870955408 in words is "one hundred thirty-seven trillion, four hundred eight billion, eight hundred seventy million, nine hundred fifty-five thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •