Base | Representation |
---|---|
bin | 11111001100010101011111… |
… | …000011100010101000110100 |
3 | 122222201222000000121200121222 |
4 | 133030111133003202220310 |
5 | 120440133233130242424 |
6 | 1203434523205525512 |
7 | 40616305226504000 |
oct | 3714253703425064 |
9 | 588658000550558 |
10 | 137187145165364 |
11 | 3a791817a91198 |
12 | 13477955413898 |
13 | 5b718ccc26448 |
14 | 25c3c71137700 |
15 | 10cd8448e1e5e |
hex | 7cc55f0e2a34 |
137187145165364 has 24 divisors (see below), whose sum is σ = 279973765646400. Its totient is φ = 58794490784568.
The previous prime is 137187145165351. The next prime is 137187145165417. The reversal of 137187145165364 is 463561541781731.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 137187145165297 and 137187145165306.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49995313922 + ... + 49995316665.
It is an arithmetic number, because the mean of its divisors is an integer number (11665573568600).
Almost surely, 2137187145165364 is an apocalyptic number.
137187145165364 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
137187145165364 is an abundant number, since it is smaller than the sum of its proper divisors (142786620481036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137187145165364 is an equidigital number, since it uses as much as digits as its factorization.
137187145165364 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99990630612 (or 99990630596 counting only the distinct ones).
The product of its digits is 50803200, while the sum is 62.
The spelling of 137187145165364 in words is "one hundred thirty-seven trillion, one hundred eighty-seven billion, one hundred forty-five million, one hundred sixty-five thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •