Base | Representation |
---|---|
bin | 10000000110100… |
… | …01011000101011 |
3 | 100102011112120112 |
4 | 20003101120223 |
5 | 234034402441 |
6 | 21223044535 |
7 | 3230056514 |
oct | 1003213053 |
9 | 312145515 |
10 | 135075371 |
11 | 6a279142 |
12 | 392a074b |
13 | 21ca4972 |
14 | 13d21a0b |
15 | bcd24eb |
hex | 80d162b |
135075371 has 2 divisors, whose sum is σ = 135075372. Its totient is φ = 135075370.
The previous prime is 135075253. The next prime is 135075377. The reversal of 135075371 is 173570531.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135075371 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (135075377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67537685 + 67537686.
It is an arithmetic number, because the mean of its divisors is an integer number (67537686).
Almost surely, 2135075371 is an apocalyptic number.
135075371 is a deficient number, since it is larger than the sum of its proper divisors (1).
135075371 is an equidigital number, since it uses as much as digits as its factorization.
135075371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11025, while the sum is 32.
The square root of 135075371 is about 11622.1930374607. The cubic root of 135075371 is about 513.0882348321.
The spelling of 135075371 in words is "one hundred thirty-five million, seventy-five thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •