Base | Representation |
---|---|
bin | 111111001010100001… |
… | …0110010001001001111 |
3 | 110222010022002121211121 |
4 | 1332111002302021033 |
5 | 4210244444133124 |
6 | 142151512501411 |
7 | 12541253255626 |
oct | 1762502621117 |
9 | 428108077747 |
10 | 135644521039 |
11 | 52587883355 |
12 | 223570aa867 |
13 | ca39419601 |
14 | 67cadc26bd |
15 | 37dd67e2e4 |
hex | 1f950b224f |
135644521039 has 2 divisors, whose sum is σ = 135644521040. Its totient is φ = 135644521038.
The previous prime is 135644521031. The next prime is 135644521057. The reversal of 135644521039 is 930125446531.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 135644521039 - 23 = 135644521031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135644520986 and 135644521004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135644521031) 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, 67822260519 + 67822260520.
It is an arithmetic number, because the mean of its divisors is an integer number (67822260520).
Almost surely, 2135644521039 is an apocalyptic number.
135644521039 is a deficient number, since it is larger than the sum of its proper divisors (1).
135644521039 is an equidigital number, since it uses as much as digits as its factorization.
135644521039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 43.
The spelling of 135644521039 in words is "one hundred thirty-five billion, six hundred forty-four million, five hundred twenty-one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •