Base | Representation |
---|---|
bin | 10000001000010… |
… | …11000010011001 |
3 | 100102121112111112 |
4 | 20010023002121 |
5 | 234114432023 |
6 | 21232110105 |
7 | 3232062131 |
oct | 1004130231 |
9 | 312545445 |
10 | 135311513 |
11 | 6a41a5a7 |
12 | 39395335 |
13 | 220582ac |
14 | 13d83ac1 |
15 | bd2c478 |
hex | 810b099 |
135311513 has 2 divisors, whose sum is σ = 135311514. Its totient is φ = 135311512.
The previous prime is 135311503. The next prime is 135311531. The reversal of 135311513 is 315113531.
Together with next prime (135311531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88416409 + 46895104 = 9403^2 + 6848^2 .
It is an emirp because it is prime and its reverse (315113531) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135311513 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (135311503) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67655756 + 67655757.
It is an arithmetic number, because the mean of its divisors is an integer number (67655757).
Almost surely, 2135311513 is an apocalyptic number.
It is an amenable number.
135311513 is a deficient number, since it is larger than the sum of its proper divisors (1).
135311513 is an equidigital number, since it uses as much as digits as its factorization.
135311513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 675, while the sum is 23.
The square root of 135311513 is about 11632.3476994113. The cubic root of 135311513 is about 513.3870584781.
The spelling of 135311513 in words is "one hundred thirty-five million, three hundred eleven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •