Base | Representation |
---|---|
bin | 111110111010111010… |
… | …1111100011000000001 |
3 | 110220202211010010011201 |
4 | 1331311311330120001 |
5 | 4203211442431002 |
6 | 142023533141201 |
7 | 12522266033311 |
oct | 1756565743001 |
9 | 426684103151 |
10 | 135121061377 |
11 | 52339353365 |
12 | 2222b92a801 |
13 | c984b3c473 |
14 | 677b681441 |
15 | 37ac730087 |
hex | 1f75d7c601 |
135121061377 has 2 divisors, whose sum is σ = 135121061378. Its totient is φ = 135121061376.
The previous prime is 135121061351. The next prime is 135121061399. The reversal of 135121061377 is 773160121531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126397314576 + 8723746801 = 355524^2 + 93401^2 .
It is a cyclic number.
It is not a de Polignac number, because 135121061377 - 231 = 132973577729 is a prime.
It is a super-2 number, since 2×1351210613772 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (135121001377) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67560530688 + 67560530689.
It is an arithmetic number, because the mean of its divisors is an integer number (67560530689).
Almost surely, 2135121061377 is an apocalyptic number.
It is an amenable number.
135121061377 is a deficient number, since it is larger than the sum of its proper divisors (1).
135121061377 is an equidigital number, since it uses as much as digits as its factorization.
135121061377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26460, while the sum is 37.
The spelling of 135121061377 in words is "one hundred thirty-five billion, one hundred twenty-one million, sixty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •