Base | Representation |
---|---|
bin | 111111000111001111… |
… | …0010101011101010011 |
3 | 110221211121200222012012 |
4 | 1332032132111131103 |
5 | 4210033240144214 |
6 | 142132534253135 |
7 | 12535444365461 |
oct | 1761636253523 |
9 | 427747628165 |
10 | 135534303059 |
11 | 52530642a11 |
12 | 223261b71ab |
13 | ca1c638c7c |
14 | 67ba4d1831 |
15 | 37d3b5c03e |
hex | 1f8e795753 |
135534303059 has 2 divisors, whose sum is σ = 135534303060. Its totient is φ = 135534303058.
The previous prime is 135534303019. The next prime is 135534303067. The reversal of 135534303059 is 950303435531.
It is a strong prime.
It is an emirp because it is prime and its reverse (950303435531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 135534303059 - 228 = 135265867603 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (135534303019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67767151529 + 67767151530.
It is an arithmetic number, because the mean of its divisors is an integer number (67767151530).
Almost surely, 2135534303059 is an apocalyptic number.
135534303059 is a deficient number, since it is larger than the sum of its proper divisors (1).
135534303059 is an equidigital number, since it uses as much as digits as its factorization.
135534303059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 364500, while the sum is 41.
The spelling of 135534303059 in words is "one hundred thirty-five billion, five hundred thirty-four million, three hundred three thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •