Base | Representation |
---|---|
bin | 111110111000001101… |
… | …1001001100101110101 |
3 | 110220112111001102022202 |
4 | 1331300123021211311 |
5 | 4203020204322131 |
6 | 142010524434245 |
7 | 12520113231125 |
oct | 1756033114565 |
9 | 426474042282 |
10 | 135030151541 |
11 | 522a200046a |
12 | 222053a8985 |
13 | c96c05c36c |
14 | 676d578c85 |
15 | 37a4773bcb |
hex | 1f706c9975 |
135030151541 has 2 divisors, whose sum is σ = 135030151542. Its totient is φ = 135030151540.
The previous prime is 135030151537. The next prime is 135030151549. The reversal of 135030151541 is 145151030531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132389733316 + 2640418225 = 363854^2 + 51385^2 .
It is a cyclic number.
It is not a de Polignac number, because 135030151541 - 22 = 135030151537 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135030151549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67515075770 + 67515075771.
It is an arithmetic number, because the mean of its divisors is an integer number (67515075771).
Almost surely, 2135030151541 is an apocalyptic number.
It is an amenable number.
135030151541 is a deficient number, since it is larger than the sum of its proper divisors (1).
135030151541 is an equidigital number, since it uses as much as digits as its factorization.
135030151541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 135030151541 in words is "one hundred thirty-five billion, thirty million, one hundred fifty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •