Base | Representation |
---|---|
bin | 111110111000101001… |
… | …1110101001011011101 |
3 | 110220120112000022111021 |
4 | 1331301103311023131 |
5 | 4203033010311031 |
6 | 142012215124141 |
7 | 12520353434506 |
oct | 1756123651335 |
9 | 426515008437 |
10 | 135045010141 |
11 | 522aa4299a8 |
12 | 2220a373651 |
13 | c972162532 |
14 | 6771525bad |
15 | 37a5c0b511 |
hex | 1f714f52dd |
135045010141 has 2 divisors, whose sum is σ = 135045010142. Its totient is φ = 135045010140.
The previous prime is 135045010129. The next prime is 135045010169. The reversal of 135045010141 is 141010540531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 123519914116 + 11525096025 = 351454^2 + 107355^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135045010141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135045010171) 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, 67522505070 + 67522505071.
It is an arithmetic number, because the mean of its divisors is an integer number (67522505071).
Almost surely, 2135045010141 is an apocalyptic number.
It is an amenable number.
135045010141 is a deficient number, since it is larger than the sum of its proper divisors (1).
135045010141 is an equidigital number, since it uses as much as digits as its factorization.
135045010141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 135045010141 its reverse (141010540531), we get a palindrome (276055550672).
The spelling of 135045010141 in words is "one hundred thirty-five billion, forty-five million, ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •