Base | Representation |
---|---|
bin | 10000000111100… |
… | …01001000011101 |
3 | 100102102010221121 |
4 | 20003301020131 |
5 | 234103033110 |
6 | 21225530541 |
7 | 3231140566 |
oct | 1003611035 |
9 | 312363847 |
10 | 135205405 |
11 | 6a357905 |
12 | 39343a51 |
13 | 2201bbca |
14 | 13d5716d |
15 | bd0acda |
hex | 80f121d |
135205405 has 4 divisors (see below), whose sum is σ = 162246492. Its totient is φ = 108164320.
The previous prime is 135205393. The next prime is 135205429. The reversal of 135205405 is 504502531.
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 64947481 + 70257924 = 8059^2 + 8382^2 .
It is not a de Polignac number, because 135205405 - 211 = 135203357 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 135205405.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 13520536 + ... + 13520545.
It is an arithmetic number, because the mean of its divisors is an integer number (40561623).
Almost surely, 2135205405 is an apocalyptic number.
It is an amenable number.
135205405 is a deficient number, since it is larger than the sum of its proper divisors (27041087).
135205405 is an equidigital number, since it uses as much as digits as its factorization.
135205405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27041086.
The product of its (nonzero) digits is 3000, while the sum is 25.
The square root of 135205405 is about 11627.7859027418. The cubic root of 135205405 is about 513.2528281671.
Adding to 135205405 its reverse (504502531), we get a palindrome (639707936).
The spelling of 135205405 in words is "one hundred thirty-five million, two hundred five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •