Base | Representation |
---|---|
bin | 111110110110011000… |
… | …0010001100111010001 |
3 | 110220101012012021211002 |
4 | 1331230300101213101 |
5 | 4202403424034221 |
6 | 142000445031345 |
7 | 12515435001653 |
oct | 1755460214721 |
9 | 426335167732 |
10 | 134968580561 |
11 | 52270277261 |
12 | 221a8855555 |
13 | c95c382329 |
14 | 676530c6d3 |
15 | 379e16080b |
hex | 1f6cc119d1 |
134968580561 has 2 divisors, whose sum is σ = 134968580562. Its totient is φ = 134968580560.
The previous prime is 134968580491. The next prime is 134968580597. The reversal of 134968580561 is 165085869431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132673691536 + 2294889025 = 364244^2 + 47905^2 .
It is a cyclic number.
It is not a de Polignac number, because 134968580561 - 214 = 134968564177 is a prime.
It is a super-2 number, since 2×1349685805612 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134968580497 and 134968580506.
It is not a weakly prime, because it can be changed into another prime (134968588561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67484290280 + 67484290281.
It is an arithmetic number, because the mean of its divisors is an integer number (67484290281).
Almost surely, 2134968580561 is an apocalyptic number.
It is an amenable number.
134968580561 is a deficient number, since it is larger than the sum of its proper divisors (1).
134968580561 is an equidigital number, since it uses as much as digits as its factorization.
134968580561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6220800, while the sum is 56.
The spelling of 134968580561 in words is "one hundred thirty-four billion, nine hundred sixty-eight million, five hundred eighty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.208 sec. • engine limits •