Base | Representation |
---|---|
bin | 10000000110110… |
… | …00111100001001 |
3 | 100102020010000112 |
4 | 20003120330021 |
5 | 234041400223 |
6 | 21223444105 |
7 | 3230245646 |
oct | 1003307411 |
9 | 312203015 |
10 | 135106313 |
11 | 6a29a411 |
12 | 392b6635 |
13 | 21cb5a84 |
14 | 13d2cdcd |
15 | bcdb778 |
hex | 80d8f09 |
135106313 has 4 divisors (see below), whose sum is σ = 135454020. Its totient is φ = 134758608.
The previous prime is 135106297. The next prime is 135106319. The reversal of 135106313 is 313601531.
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 54878464 + 80227849 = 7408^2 + 8957^2 .
It is a cyclic number.
It is not a de Polignac number, because 135106313 - 24 = 135106297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135106319) 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, 173270 + ... + 174047.
It is an arithmetic number, because the mean of its divisors is an integer number (33863505).
Almost surely, 2135106313 is an apocalyptic number.
It is an amenable number.
135106313 is a deficient number, since it is larger than the sum of its proper divisors (347707).
135106313 is an equidigital number, since it uses as much as digits as its factorization.
135106313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347706.
The product of its (nonzero) digits is 810, while the sum is 23.
The square root of 135106313 is about 11623.5241213670. The cubic root of 135106313 is about 513.1274099088.
Adding to 135106313 its reverse (313601531), we get a palindrome (448707844).
The spelling of 135106313 in words is "one hundred thirty-five million, one hundred six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •