Base | Representation |
---|---|
bin | 111111111101111110… |
… | …1100001111011100000 |
3 | 111010120122010212011202 |
4 | 1333323331201323200 |
5 | 4222314011302102 |
6 | 143035113300332 |
7 | 12632120624030 |
oct | 1777375417340 |
9 | 433518125152 |
10 | 137371197152 |
11 | 53293506702 |
12 | 227594046a8 |
13 | cc53075c57 |
14 | 691244d8c0 |
15 | 3890051e02 |
hex | 1ffbf61ee0 |
137371197152 has 144 divisors (see below), whose sum is σ = 345401249760. Its totient is φ = 52493377536.
The previous prime is 137371197097. The next prime is 137371197167. The reversal of 137371197152 is 251791173731.
It is a super-2 number, since 2×1373711971522 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 137371197097 and 137371197106.
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, 1324724 + ... + 1424652.
It is an arithmetic number, because the mean of its divisors is an integer number (2398619790).
Almost surely, 2137371197152 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 137371197152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172700624880).
137371197152 is an abundant number, since it is smaller than the sum of its proper divisors (208030052608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137371197152 is a wasteful number, since it uses less digits than its factorization.
137371197152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100001 (or 99974 counting only the distinct ones).
The product of its digits is 277830, while the sum is 47.
The spelling of 137371197152 in words is "one hundred thirty-seven billion, three hundred seventy-one million, one hundred ninety-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •