Base | Representation |
---|---|
bin | 10000001010111… |
… | …00100010101001 |
3 | 100110020111102222 |
4 | 20011130202221 |
5 | 234211122403 |
6 | 21243203425 |
7 | 3234652334 |
oct | 1005344251 |
9 | 313214388 |
10 | 135645353 |
11 | 6a6283a8 |
12 | 39516575 |
13 | 2214422c |
14 | 1402d61b |
15 | bd96338 |
hex | 815c8a9 |
135645353 has 4 divisors (see below), whose sum is σ = 135673860. Its totient is φ = 135616848.
The previous prime is 135645317. The next prime is 135645361. The reversal of 135645353 is 353546531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 353546531 = 13 ⋅27195887.
It can be written as a sum of positive squares in 2 ways, for example, as 64192144 + 71453209 = 8012^2 + 8453^2 .
It is a cyclic number.
It is not a de Polignac number, because 135645353 - 224 = 118868137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135615353) by changing a digit.
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, 5198 + ... + 17271.
It is an arithmetic number, because the mean of its divisors is an integer number (33918465).
Almost surely, 2135645353 is an apocalyptic number.
It is an amenable number.
135645353 is a deficient number, since it is larger than the sum of its proper divisors (28507).
135645353 is an equidigital number, since it uses as much as digits as its factorization.
135645353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28506.
The product of its digits is 81000, while the sum is 35.
The square root of 135645353 is about 11646.6884993117. The cubic root of 135645353 is about 513.8089205318.
The spelling of 135645353 in words is "one hundred thirty-five million, six hundred forty-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •