Base | Representation |
---|---|
bin | 10000001010001… |
… | …11010111111001 |
3 | 100110002002111201 |
4 | 20011013113321 |
5 | 234200334044 |
6 | 21241254201 |
7 | 3234141502 |
oct | 1005072771 |
9 | 313062451 |
10 | 135558649 |
11 | 6a579246 |
12 | 39494361 |
13 | 22113925 |
14 | 14009ba9 |
15 | bd7a7d4 |
hex | 81475f9 |
135558649 has 8 divisors (see below), whose sum is σ = 136500480. Its totient is φ = 134620416.
The previous prime is 135558641. The next prime is 135558677. The reversal of 135558649 is 946855531.
135558649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 135558649 - 23 = 135558641 is a prime.
It is a super-2 number, since 2×1355586492 = 36752294637410402, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135558599 and 135558608.
It is not an unprimeable number, because it can be changed into a prime (135558641) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 137412 + ... + 138394.
It is an arithmetic number, because the mean of its divisors is an integer number (17062560).
Almost surely, 2135558649 is an apocalyptic number.
It is an amenable number.
135558649 is a deficient number, since it is larger than the sum of its proper divisors (941831).
135558649 is an equidigital number, since it uses as much as digits as its factorization.
135558649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1799.
The product of its digits is 648000, while the sum is 46.
The square root of 135558649 is about 11642.9656445426. The cubic root of 135558649 is about 513.6994222877.
The spelling of 135558649 in words is "one hundred thirty-five million, five hundred fifty-eight thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.103 sec. • engine limits •