Base | Representation |
---|---|
bin | 10000010000010… |
… | …00101100101111 |
3 | 100111120022201221 |
4 | 20020020230233 |
5 | 234401204021 |
6 | 21310244211 |
7 | 3243650233 |
oct | 1010105457 |
9 | 314508657 |
10 | 136350511 |
11 | 6aa6a180 |
12 | 397b6667 |
13 | 2233019b |
14 | 141745c3 |
15 | be85241 |
hex | 8208b2f |
136350511 has 4 divisors (see below), whose sum is σ = 148746024. Its totient is φ = 123955000.
The previous prime is 136350497. The next prime is 136350541. The reversal of 136350511 is 115053631.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 136350511 - 211 = 136348463 is a prime.
It is a super-2 number, since 2×1363505112 = 37182923699922242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136350541) 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, 6197740 + ... + 6197761.
It is an arithmetic number, because the mean of its divisors is an integer number (37186506).
Almost surely, 2136350511 is an apocalyptic number.
136350511 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
136350511 is a deficient number, since it is larger than the sum of its proper divisors (12395513).
136350511 is a wasteful number, since it uses less digits than its factorization.
136350511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12395512.
The product of its (nonzero) digits is 1350, while the sum is 25.
The square root of 136350511 is about 11676.9221544035. The cubic root of 136350511 is about 514.6977344639.
The spelling of 136350511 in words is "one hundred thirty-six million, three hundred fifty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •