Base | Representation |
---|---|
bin | 10000000111000… |
… | …00010000111001 |
3 | 100102021122011122 |
4 | 20003200100321 |
5 | 234043330223 |
6 | 21224235025 |
7 | 3230432264 |
oct | 1003402071 |
9 | 312248148 |
10 | 135136313 |
11 | 6a30aa04 |
12 | 3930ba75 |
13 | 21cc6620 |
14 | 13d39cdb |
15 | bce55c8 |
hex | 80e0439 |
135136313 has 4 divisors (see below), whose sum is σ = 145531428. Its totient is φ = 124741200.
The previous prime is 135136301. The next prime is 135136333. The reversal of 135136313 is 313631531.
It is a happy number.
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 39037504 + 96098809 = 6248^2 + 9803^2 .
It is a cyclic number.
It is not a de Polignac number, because 135136313 - 26 = 135136249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135136333) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5197538 + ... + 5197563.
It is an arithmetic number, because the mean of its divisors is an integer number (36382857).
Almost surely, 2135136313 is an apocalyptic number.
135136313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
135136313 is a deficient number, since it is larger than the sum of its proper divisors (10395115).
135136313 is a wasteful number, since it uses less digits than its factorization.
135136313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10395114.
The product of its digits is 2430, while the sum is 26.
The square root of 135136313 is about 11624.8145361550. The cubic root of 135136313 is about 513.1653866269.
Adding to 135136313 its reverse (313631531), we get a palindrome (448767844).
The spelling of 135136313 in words is "one hundred thirty-five million, one hundred thirty-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •