Base | Representation |
---|---|
bin | 10000000110000… |
… | …10011101110101 |
3 | 100102001102202012 |
4 | 20003002131311 |
5 | 234030424021 |
6 | 21221454005 |
7 | 3226413404 |
oct | 1003023565 |
9 | 312042665 |
10 | 135014261 |
11 | 6a237238 |
12 | 39271305 |
13 | 21c82bc5 |
14 | 13d0763b |
15 | bcbe35b |
hex | 80c2775 |
135014261 has 2 divisors, whose sum is σ = 135014262. Its totient is φ = 135014260.
The previous prime is 135014249. The next prime is 135014263. The reversal of 135014261 is 162410531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113018161 + 21996100 = 10631^2 + 4690^2 .
It is an emirp because it is prime and its reverse (162410531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 135014261 - 210 = 135013237 is a prime.
It is a super-2 number, since 2×1350142612 = 36457701346752242, which contains 22 as substring.
Together with 135014263, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135014263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67507130 + 67507131.
It is an arithmetic number, because the mean of its divisors is an integer number (67507131).
Almost surely, 2135014261 is an apocalyptic number.
It is an amenable number.
135014261 is a deficient number, since it is larger than the sum of its proper divisors (1).
135014261 is an equidigital number, since it uses as much as digits as its factorization.
135014261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 135014261 is about 11619.5637181436. The cubic root of 135014261 is about 513.0108470462.
Adding to 135014261 its reverse (162410531), we get a palindrome (297424792).
The spelling of 135014261 in words is "one hundred thirty-five million, fourteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •