Base | Representation |
---|---|
bin | 10000001101000… |
… | …11101111110101 |
3 | 100110210022112012 |
4 | 20012203233311 |
5 | 234244441023 |
6 | 21253334005 |
7 | 3240305552 |
oct | 1006435765 |
9 | 313708465 |
10 | 135937013 |
11 | 6a807543 |
12 | 39637305 |
13 | 22216c04 |
14 | 140a7a29 |
15 | be02978 |
hex | 81a3bf5 |
135937013 has 2 divisors, whose sum is σ = 135937014. Its totient is φ = 135937012.
The previous prime is 135936991. The next prime is 135937027. The reversal of 135937013 is 310739531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 133240849 + 2696164 = 11543^2 + 1642^2 .
It is a cyclic number.
It is not a de Polignac number, because 135937013 - 220 = 134888437 is a prime.
It is a super-3 number, since 3×1359370133 (a number of 25 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135937033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67968506 + 67968507.
It is an arithmetic number, because the mean of its divisors is an integer number (67968507).
Almost surely, 2135937013 is an apocalyptic number.
It is an amenable number.
135937013 is a deficient number, since it is larger than the sum of its proper divisors (1).
135937013 is an equidigital number, since it uses as much as digits as its factorization.
135937013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8505, while the sum is 32.
The square root of 135937013 is about 11659.2029315901. The cubic root of 135937013 is about 514.1769150322.
The spelling of 135937013 in words is "one hundred thirty-five million, nine hundred thirty-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •