Base | Representation |
---|---|
bin | 111111111110101000… |
… | …0110011010111111001 |
3 | 111010122011012220111002 |
4 | 1333331100303113321 |
5 | 4222340103322203 |
6 | 143041213214345 |
7 | 12632504312426 |
oct | 1777520632771 |
9 | 433564186432 |
10 | 137393026553 |
11 | 532a4866432 |
12 | 227647913b5 |
13 | cc57749c63 |
14 | 69152d2d4d |
15 | 3891e14d88 |
hex | 1ffd4335f9 |
137393026553 has 2 divisors, whose sum is σ = 137393026554. Its totient is φ = 137393026552.
The previous prime is 137393026471. The next prime is 137393026567. The reversal of 137393026553 is 355620393731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104282493184 + 33110533369 = 322928^2 + 181963^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-137393026553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 137393026498 and 137393026507.
It is not a weakly prime, because it can be changed into another prime (137393626553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68696513276 + 68696513277.
It is an arithmetic number, because the mean of its divisors is an integer number (68696513277).
Almost surely, 2137393026553 is an apocalyptic number.
It is an amenable number.
137393026553 is a deficient number, since it is larger than the sum of its proper divisors (1).
137393026553 is an equidigital number, since it uses as much as digits as its factorization.
137393026553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1530900, while the sum is 47.
The spelling of 137393026553 in words is "one hundred thirty-seven billion, three hundred ninety-three million, twenty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •