Base | Representation |
---|---|
bin | 111110111001001110… |
… | …0101111011010010011 |
3 | 110220121211222100102221 |
4 | 1331302130233122103 |
5 | 4203102403414102 |
6 | 142014140521511 |
7 | 12521005050301 |
oct | 1756234573223 |
9 | 426554870387 |
10 | 135064123027 |
11 | 5230a1a3779 |
12 | 22214850297 |
13 | c9760c4c32 |
14 | 6773c9d271 |
15 | 37a7734637 |
hex | 1f7272f693 |
135064123027 has 2 divisors, whose sum is σ = 135064123028. Its totient is φ = 135064123026.
The previous prime is 135064123013. The next prime is 135064123043. The reversal of 135064123027 is 720321460531.
It is a weak prime.
It is an emirp because it is prime and its reverse (720321460531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 135064123027 - 231 = 132916639379 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135064122983 and 135064123001.
It is not a weakly prime, because it can be changed into another prime (135064123057) 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, 67532061513 + 67532061514.
It is an arithmetic number, because the mean of its divisors is an integer number (67532061514).
Almost surely, 2135064123027 is an apocalyptic number.
135064123027 is a deficient number, since it is larger than the sum of its proper divisors (1).
135064123027 is an equidigital number, since it uses as much as digits as its factorization.
135064123027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 34.
Adding to 135064123027 its reverse (720321460531), we get a palindrome (855385583558).
The spelling of 135064123027 in words is "one hundred thirty-five billion, sixty-four million, one hundred twenty-three thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •