Base | Representation |
---|---|
bin | 10000000111110… |
… | …10010100110101 |
3 | 100102111001121021 |
4 | 20003322110311 |
5 | 234110234221 |
6 | 21230421141 |
7 | 3231355432 |
oct | 1003722465 |
9 | 312431537 |
10 | 135243061 |
11 | 6a383128 |
12 | 393617b1 |
13 | 220330a5 |
14 | 13d66b89 |
15 | bd17041 |
hex | 80fa535 |
135243061 has 4 divisors (see below), whose sum is σ = 135929772. Its totient is φ = 134556352.
The previous prime is 135242993. The next prime is 135243077. The reversal of 135243061 is 160342531.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 86676100 + 48566961 = 9310^2 + 6969^2 .
It is a cyclic number.
It is not a de Polignac number, because 135243061 - 227 = 1025333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135243091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 343060 + ... + 343453.
It is an arithmetic number, because the mean of its divisors is an integer number (33982443).
Almost surely, 2135243061 is an apocalyptic number.
It is an amenable number.
135243061 is a deficient number, since it is larger than the sum of its proper divisors (686711).
135243061 is an equidigital number, since it uses as much as digits as its factorization.
135243061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686710.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 135243061 is about 11629.4050148750. The cubic root of 135243061 is about 513.3004723535.
Adding to 135243061 its reverse (160342531), we get a palindrome (295585592).
The spelling of 135243061 in words is "one hundred thirty-five million, two hundred forty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •