Base | Representation |
---|---|
bin | 10000010000000… |
… | …10110001111110 |
3 | 100111112002111010 |
4 | 20020002301332 |
5 | 234344420040 |
6 | 21305540050 |
7 | 3243516453 |
oct | 1010026176 |
9 | 314462433 |
10 | 136326270 |
11 | 6aa52a43 |
12 | 397a4626 |
13 | 22322142 |
14 | 1416982a |
15 | be7ce80 |
hex | 8202c7e |
136326270 has 16 divisors (see below), whose sum is σ = 327183120. Its totient is φ = 36353664.
The previous prime is 136326233. The next prime is 136326283. The reversal of 136326270 is 72623631.
It is a super-2 number, since 2×1363262702 = 37169703784225800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 4544209 = 136326270 / (1 + 3 + 6 + 3 + 2 + 6 + 2 + 7 + 0).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2272075 + ... + 2272134.
It is an arithmetic number, because the mean of its divisors is an integer number (20448945).
Almost surely, 2136326270 is an apocalyptic number.
136326270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136326270 is an abundant number, since it is smaller than the sum of its proper divisors (190856850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136326270 is a wasteful number, since it uses less digits than its factorization.
136326270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4544219.
The product of its (nonzero) digits is 9072, while the sum is 30.
The square root of 136326270 is about 11675.8841206994. The cubic root of 136326270 is about 514.6672309057.
The spelling of 136326270 in words is "one hundred thirty-six million, three hundred twenty-six thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •