Base | Representation |
---|---|
bin | 10000001110111… |
… | …00011010000111 |
3 | 100111020002212211 |
4 | 20013130122013 |
5 | 234324402340 |
6 | 21302324251 |
7 | 3242263306 |
oct | 1007343207 |
9 | 314202784 |
10 | 136169095 |
11 | 6a955947 |
12 | 39729687 |
13 | 2229873a |
14 | 1412843d |
15 | be4b5ea |
hex | 81dc687 |
136169095 has 12 divisors (see below), whose sum is σ = 164717784. Its totient is φ = 108065600.
The previous prime is 136169093. The next prime is 136169107. The reversal of 136169095 is 590961631.
It is not a de Polignac number, because 136169095 - 21 = 136169093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136169093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 93120 + ... + 94570.
It is an arithmetic number, because the mean of its divisors is an integer number (13726482).
Almost surely, 2136169095 is an apocalyptic number.
136169095 is a deficient number, since it is larger than the sum of its proper divisors (28548689).
136169095 is an equidigital number, since it uses as much as digits as its factorization.
136169095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1730 (or 1593 counting only the distinct ones).
The product of its (nonzero) digits is 43740, while the sum is 40.
The square root of 136169095 is about 11669.1514258750. The cubic root of 136169095 is about 514.4693626348.
The spelling of 136169095 in words is "one hundred thirty-six million, one hundred sixty-nine thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •