Base | Representation |
---|---|
bin | 10000001101001… |
… | …00101100110001 |
3 | 100110210111212122 |
4 | 20012210230301 |
5 | 234300102123 |
6 | 21253404025 |
7 | 3240323123 |
oct | 1006445461 |
9 | 313714778 |
10 | 135940913 |
11 | 6a80a469 |
12 | 39639615 |
13 | 22218914 |
14 | 140a9213 |
15 | be03bc8 |
hex | 81a4b31 |
135940913 has 2 divisors, whose sum is σ = 135940914. Its totient is φ = 135940912.
The previous prime is 135940907. The next prime is 135940939. The reversal of 135940913 is 319049531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93064609 + 42876304 = 9647^2 + 6548^2 .
It is an emirp because it is prime and its reverse (319049531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 135940913 - 28 = 135940657 is a prime.
It is not a weakly prime, because it can be changed into another prime (135940963) 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, 67970456 + 67970457.
It is an arithmetic number, because the mean of its divisors is an integer number (67970457).
Almost surely, 2135940913 is an apocalyptic number.
It is an amenable number.
135940913 is a deficient number, since it is larger than the sum of its proper divisors (1).
135940913 is an equidigital number, since it uses as much as digits as its factorization.
135940913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 35.
The square root of 135940913 is about 11659.3701802456. The cubic root of 135940913 is about 514.1818321889.
The spelling of 135940913 in words is "one hundred thirty-five million, nine hundred forty thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •