Base | Representation |
---|---|
bin | 111111001011101110… |
… | …1001100101111001001 |
3 | 110222020010021011201110 |
4 | 1332113131030233021 |
5 | 4210340330001022 |
6 | 142155520240533 |
7 | 12542254320531 |
oct | 1762735145711 |
9 | 428203234643 |
10 | 135685000137 |
11 | 525a8710955 |
12 | 22368770149 |
13 | ca4492023b |
14 | 67d251c4c1 |
15 | 37e1ec800c |
hex | 1f9774cbc9 |
135685000137 has 8 divisors (see below), whose sum is σ = 180944192736. Its totient is φ = 90441237152.
The previous prime is 135685000109. The next prime is 135685000189. The reversal of 135685000137 is 731000586531.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135685000137 - 226 = 135617891273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135685000095 and 135685000104.
It is not an unprimeable number, because it can be changed into a prime (135685070137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3836868 + ... + 3872069.
It is an arithmetic number, because the mean of its divisors is an integer number (22618024092).
Almost surely, 2135685000137 is an apocalyptic number.
It is an amenable number.
135685000137 is a deficient number, since it is larger than the sum of its proper divisors (45259192599).
135685000137 is an equidigital number, since it uses as much as digits as its factorization.
135685000137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7714807.
The product of its (nonzero) digits is 75600, while the sum is 39.
Adding to 135685000137 its reverse (731000586531), we get a palindrome (866685586668).
The spelling of 135685000137 in words is "one hundred thirty-five billion, six hundred eighty-five million, one hundred thirty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •