Base | Representation |
---|---|
bin | 10000001011000… |
… | …10111011010011 |
3 | 100110021211022122 |
4 | 20011202323103 |
5 | 234212442012 |
6 | 21243524455 |
7 | 3235121516 |
oct | 1005427323 |
9 | 313254278 |
10 | 135671507 |
11 | 6a646014 |
12 | 3952972b |
13 | 221530ca |
14 | 14038d7d |
15 | bd9de72 |
hex | 8162ed3 |
135671507 has 2 divisors, whose sum is σ = 135671508. Its totient is φ = 135671506.
The previous prime is 135671491. The next prime is 135671521. The reversal of 135671507 is 705176531.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 135671507 - 24 = 135671491 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (135671567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67835753 + 67835754.
It is an arithmetic number, because the mean of its divisors is an integer number (67835754).
Almost surely, 2135671507 is an apocalyptic number.
135671507 is a deficient number, since it is larger than the sum of its proper divisors (1).
135671507 is an equidigital number, since it uses as much as digits as its factorization.
135671507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22050, while the sum is 35.
The square root of 135671507 is about 11647.8112536219. The cubic root of 135671507 is about 513.8419411861.
The spelling of 135671507 in words is "one hundred thirty-five million, six hundred seventy-one thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •