Base | Representation |
---|---|
bin | 10000001110010… |
… | …10011100000011 |
3 | 100111002100220202 |
4 | 20013022130003 |
5 | 234320023431 |
6 | 21300555415 |
7 | 3241535600 |
oct | 1007123403 |
9 | 314070822 |
10 | 136095491 |
11 | 6a905614 |
12 | 396b2b6b |
13 | 2227109c |
14 | 141096a7 |
15 | be348cb |
hex | 81ca703 |
136095491 has 12 divisors (see below), whose sum is σ = 158545728. Its totient is φ = 116483472.
The previous prime is 136095457. The next prime is 136095511. The reversal of 136095491 is 194590631.
It is a de Polignac number, because none of the positive numbers 2k-136095491 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136095431) 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 11 ways as a sum of consecutive naturals, for example, 41390 + ... + 44556.
It is an arithmetic number, because the mean of its divisors is an integer number (13212144).
Almost surely, 2136095491 is an apocalyptic number.
136095491 is a deficient number, since it is larger than the sum of its proper divisors (22450237).
136095491 is an equidigital number, since it uses as much as digits as its factorization.
136095491 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4058 (or 4051 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 38.
The square root of 136095491 is about 11665.9972141262. The cubic root of 136095491 is about 514.3766498995.
The spelling of 136095491 in words is "one hundred thirty-six million, ninety-five thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •