Base | Representation |
---|---|
bin | 111110111001001111… |
… | …0000000001110001011 |
3 | 110220121212121011111012 |
4 | 1331302132000032023 |
5 | 4203103000012102 |
6 | 142014151554135 |
7 | 12521010626306 |
oct | 1756236001613 |
9 | 426555534435 |
10 | 135064454027 |
11 | 5230a3aa428 |
12 | 2221498b94b |
13 | c9761ac7a9 |
14 | 6773d47b3d |
15 | 37a779c752 |
hex | 1f7278038b |
135064454027 has 2 divisors, whose sum is σ = 135064454028. Its totient is φ = 135064454026.
The previous prime is 135064454023. The next prime is 135064454029. The reversal of 135064454027 is 720454460531.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 135064454027 - 22 = 135064454023 is a prime.
It is a super-2 number, since 2×1350644540272 (a number of 23 digits) contains 22 as substring.
Together with 135064454029, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (135064454023) 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, 67532227013 + 67532227014.
It is an arithmetic number, because the mean of its divisors is an integer number (67532227014).
Almost surely, 2135064454027 is an apocalyptic number.
135064454027 is a deficient number, since it is larger than the sum of its proper divisors (1).
135064454027 is an equidigital number, since it uses as much as digits as its factorization.
135064454027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 403200, while the sum is 41.
The spelling of 135064454027 in words is "one hundred thirty-five billion, sixty-four million, four hundred fifty-four thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •