Base | Representation |
---|---|
bin | 10000001011001… |
… | …00010010001111 |
3 | 100110022002221201 |
4 | 20011210102033 |
5 | 234213131241 |
6 | 21244010331 |
7 | 3235143655 |
oct | 1005442217 |
9 | 313262851 |
10 | 135677071 |
11 | 6a64a212 |
12 | 395309a7 |
13 | 221557ba |
14 | 1403add5 |
15 | bda0931 |
hex | 816448f |
135677071 has 2 divisors, whose sum is σ = 135677072. Its totient is φ = 135677070.
The previous prime is 135677063. The next prime is 135677089. The reversal of 135677071 is 170776531.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (170776531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 135677071 - 23 = 135677063 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135677071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135677011) 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, 67838535 + 67838536.
It is an arithmetic number, because the mean of its divisors is an integer number (67838536).
Almost surely, 2135677071 is an apocalyptic number.
135677071 is a deficient number, since it is larger than the sum of its proper divisors (1).
135677071 is an equidigital number, since it uses as much as digits as its factorization.
135677071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30870, while the sum is 37.
The square root of 135677071 is about 11648.0500943291. The cubic root of 135677071 is about 513.8489654502.
The spelling of 135677071 in words is "one hundred thirty-five million, six hundred seventy-seven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •