Base | Representation |
---|---|
bin | 111111000010001010… |
… | …1000011111000000101 |
3 | 110221101202102201220222 |
4 | 1332010111003320011 |
5 | 4204211202141324 |
6 | 142104014234125 |
7 | 12531306601445 |
oct | 1760425037005 |
9 | 427352381828 |
10 | 135364099589 |
11 | 52453561594 |
12 | 222991b5945 |
13 | c9c32b5164 |
14 | 67a1a68125 |
15 | 37c3c3b55e |
hex | 1f84543e05 |
135364099589 has 2 divisors, whose sum is σ = 135364099590. Its totient is φ = 135364099588.
The previous prime is 135364099561. The next prime is 135364099609. The reversal of 135364099589 is 985990463531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83952165025 + 51411934564 = 289745^2 + 226742^2 .
It is a cyclic number.
It is not a de Polignac number, because 135364099589 - 220 = 135363051013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135364029589) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67682049794 + 67682049795.
It is an arithmetic number, because the mean of its divisors is an integer number (67682049795).
Almost surely, 2135364099589 is an apocalyptic number.
It is an amenable number.
135364099589 is a deficient number, since it is larger than the sum of its proper divisors (1).
135364099589 is an equidigital number, since it uses as much as digits as its factorization.
135364099589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31492800, while the sum is 62.
The spelling of 135364099589 in words is "one hundred thirty-five billion, three hundred sixty-four million, ninety-nine thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •