Base | Representation |
---|---|
bin | 1000000000011101100… |
… | …1101000100111011101 |
3 | 111011002000021020112021 |
4 | 2000013121220213131 |
5 | 4223212124121244 |
6 | 143110130540141 |
7 | 12636641114152 |
oct | 2000731504735 |
9 | 434060236467 |
10 | 137563113949 |
11 | 53381878628 |
12 | 227b1737651 |
13 | cc83a5cca1 |
14 | 692db2a229 |
15 | 38a1d11284 |
hex | 20076689dd |
137563113949 has 2 divisors, whose sum is σ = 137563113950. Its totient is φ = 137563113948.
The previous prime is 137563113931. The next prime is 137563113959. The reversal of 137563113949 is 949311365731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116929802500 + 20633311449 = 341950^2 + 143643^2 .
It is a cyclic number.
It is not a de Polignac number, because 137563113949 - 29 = 137563113437 is a prime.
It is a super-2 number, since 2×1375631139492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 137563113896 and 137563113905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137563113959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68781556974 + 68781556975.
It is an arithmetic number, because the mean of its divisors is an integer number (68781556975).
Almost surely, 2137563113949 is an apocalyptic number.
It is an amenable number.
137563113949 is a deficient number, since it is larger than the sum of its proper divisors (1).
137563113949 is an equidigital number, since it uses as much as digits as its factorization.
137563113949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1837080, while the sum is 52.
The spelling of 137563113949 in words is "one hundred thirty-seven billion, five hundred sixty-three million, one hundred thirteen thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •