Base | Representation |
---|---|
bin | 111111000000011001… |
… | …1110011100010100101 |
3 | 110221020122022201111102 |
4 | 1332000303303202211 |
5 | 4204101043102102 |
6 | 142054104445445 |
7 | 12526661644145 |
oct | 1760063634245 |
9 | 427218281442 |
10 | 135305050277 |
11 | 5242319aa01 |
12 | 22281479885 |
13 | c9b3cabb37 |
14 | 6797c96925 |
15 | 37bd975402 |
hex | 1f80cf38a5 |
135305050277 has 2 divisors, whose sum is σ = 135305050278. Its totient is φ = 135305050276.
The previous prime is 135305050211. The next prime is 135305050337. The reversal of 135305050277 is 772050503531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113362849636 + 21942200641 = 336694^2 + 148129^2 .
It is a cyclic number.
It is not a de Polignac number, because 135305050277 - 212 = 135305046181 is a prime.
It is a super-2 number, since 2×1353050502772 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 135305050277.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135305056277) 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, 67652525138 + 67652525139.
It is an arithmetic number, because the mean of its divisors is an integer number (67652525139).
Almost surely, 2135305050277 is an apocalyptic number.
It is an amenable number.
135305050277 is a deficient number, since it is larger than the sum of its proper divisors (1).
135305050277 is an equidigital number, since it uses as much as digits as its factorization.
135305050277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110250, while the sum is 38.
The spelling of 135305050277 in words is "one hundred thirty-five billion, three hundred five million, fifty thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •