Base | Representation |
---|---|
bin | 10000000110001… |
… | …11111111110001 |
3 | 100102002120211011 |
4 | 20003013333301 |
5 | 234032140123 |
6 | 21222150521 |
7 | 3226536424 |
oct | 1003077761 |
9 | 312076734 |
10 | 135036913 |
11 | 6a252260 |
12 | 39282441 |
13 | 21c902cb |
14 | 13d119bb |
15 | bcc5e0d |
hex | 80c7ff1 |
135036913 has 4 divisors (see below), whose sum is σ = 147313008. Its totient is φ = 122760820.
The previous prime is 135036877. The next prime is 135036917. The reversal of 135036913 is 319630531.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 135036913 - 213 = 135028721 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135036917) 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, 6138031 + ... + 6138052.
It is an arithmetic number, because the mean of its divisors is an integer number (36828252).
Almost surely, 2135036913 is an apocalyptic number.
It is an amenable number.
135036913 is a deficient number, since it is larger than the sum of its proper divisors (12276095).
135036913 is a wasteful number, since it uses less digits than its factorization.
135036913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12276094.
The product of its (nonzero) digits is 7290, while the sum is 31.
The square root of 135036913 is about 11620.5384126554. The cubic root of 135036913 is about 513.0395355512.
The spelling of 135036913 in words is "one hundred thirty-five million, thirty-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •