Base | Representation |
---|---|
bin | 10000010100100… |
… | …01001001010011 |
3 | 100112121201101100 |
4 | 20022101021103 |
5 | 240022100040 |
6 | 21330235443 |
7 | 3251465520 |
oct | 1012211123 |
9 | 315551340 |
10 | 136909395 |
11 | 70311067 |
12 | 39a25b83 |
13 | 2249769c |
14 | 1427c147 |
15 | c045b30 |
hex | 8291253 |
136909395 has 48 divisors (see below), whose sum is σ = 273124800. Its totient is φ = 62145792.
The previous prime is 136909393. The next prime is 136909397. The reversal of 136909395 is 593909631.
It is an interprime number because it is at equal distance from previous prime (136909393) and next prime (136909397).
It is not a de Polignac number, because 136909395 - 21 = 136909393 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 136909395.
It is not an unprimeable number, because it can be changed into a prime (136909393) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 45477 + ... + 48393.
It is an arithmetic number, because the mean of its divisors is an integer number (5690100).
Almost surely, 2136909395 is an apocalyptic number.
136909395 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
136909395 is a deficient number, since it is larger than the sum of its proper divisors (136215405).
136909395 is a wasteful number, since it uses less digits than its factorization.
136909395 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3084 (or 3081 counting only the distinct ones).
The product of its (nonzero) digits is 196830, while the sum is 45.
The square root of 136909395 is about 11700.8288167976. The cubic root of 136909395 is about 515.4000034333.
The spelling of 136909395 in words is "one hundred thirty-six million, nine hundred nine thousand, three hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •