Base | Representation |
---|---|
bin | 10000000110000… |
… | …11111011010101 |
3 | 100102001201221211 |
4 | 20003003323111 |
5 | 234031121440 |
6 | 21221541421 |
7 | 3226440013 |
oct | 1003037325 |
9 | 312051854 |
10 | 135020245 |
11 | 6a240788 |
12 | 39274871 |
13 | 21c85849 |
14 | 13d098b3 |
15 | bcc0eea |
hex | 80c3ed5 |
135020245 has 4 divisors (see below), whose sum is σ = 162024300. Its totient is φ = 108016192.
The previous prime is 135020233. The next prime is 135020269. The reversal of 135020245 is 542020531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 542020531 = 13 ⋅41693887.
It can be written as a sum of positive squares in 2 ways, for example, as 75637809 + 59382436 = 8697^2 + 7706^2 .
It is a cyclic number.
It is not a de Polignac number, because 135020245 - 29 = 135019733 is a prime.
It is a congruent number.
It is an unprimeable number.
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, 13502020 + ... + 13502029.
It is an arithmetic number, because the mean of its divisors is an integer number (40506075).
Almost surely, 2135020245 is an apocalyptic number.
It is an amenable number.
135020245 is a deficient number, since it is larger than the sum of its proper divisors (27004055).
135020245 is an equidigital number, since it uses as much as digits as its factorization.
135020245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27004054.
The product of its (nonzero) digits is 1200, while the sum is 22.
The square root of 135020245 is about 11619.8212120497. The cubic root of 135020245 is about 513.0184260272.
Adding to 135020245 its reverse (542020531), we get a palindrome (677040776).
The spelling of 135020245 in words is "one hundred thirty-five million, twenty thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •