Base | Representation |
---|---|
bin | 10000001100111… |
… | …00011000101001 |
3 | 100110201210011022 |
4 | 20012130120221 |
5 | 234243004412 |
6 | 21252542225 |
7 | 3240121622 |
oct | 1006343051 |
9 | 313653138 |
10 | 135906857 |
11 | 6a796919 |
12 | 39621975 |
13 | 22206278 |
14 | 1409aa49 |
15 | bde8a72 |
hex | 819c629 |
135906857 has 4 divisors (see below), whose sum is σ = 143901396. Its totient is φ = 127912320.
The previous prime is 135906853. The next prime is 135906863. The reversal of 135906857 is 758609531.
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 107827456 + 28079401 = 10384^2 + 5299^2 .
It is a cyclic number.
It is not a de Polignac number, because 135906857 - 22 = 135906853 is a prime.
It is not an unprimeable number, because it can be changed into a prime (135906853) 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, 3997244 + ... + 3997277.
It is an arithmetic number, because the mean of its divisors is an integer number (35975349).
Almost surely, 2135906857 is an apocalyptic number.
135906857 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
135906857 is a deficient number, since it is larger than the sum of its proper divisors (7994539).
135906857 is an equidigital number, since it uses as much as digits as its factorization.
135906857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7994538.
The product of its (nonzero) digits is 226800, while the sum is 44.
The square root of 135906857 is about 11657.9096325199. The cubic root of 135906857 is about 514.1388908879.
The spelling of 135906857 in words is "one hundred thirty-five million, nine hundred six thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •