Base | Representation |
---|---|
bin | 1000101011100… |
… | …0111101010001 |
3 | 2112111202222202 |
4 | 2022320331101 |
5 | 33310043134 |
6 | 3340212545 |
7 | 621321116 |
oct | 212707521 |
9 | 75452882 |
10 | 36409169 |
11 | 19608825 |
12 | 1023a155 |
13 | 770a2b4 |
14 | 4b9a90d |
15 | 32e2d7e |
hex | 22b8f51 |
36409169 has 2 divisors, whose sum is σ = 36409170. Its totient is φ = 36409168.
The previous prime is 36409151. The next prime is 36409171. The reversal of 36409169 is 96190463.
36409169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30382144 + 6027025 = 5512^2 + 2455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-36409169 is a prime.
It is a super-2 number, since 2×364091692 = 2651255174541122, which contains 22 as substring.
Together with 36409171, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (36409199) 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 as a sum of consecutive naturals, namely, 18204584 + 18204585.
It is an arithmetic number, because the mean of its divisors is an integer number (18204585).
Almost surely, 236409169 is an apocalyptic number.
It is an amenable number.
36409169 is a deficient number, since it is larger than the sum of its proper divisors (1).
36409169 is an equidigital number, since it uses as much as digits as its factorization.
36409169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 38.
The square root of 36409169 is about 6034.0010772289. The cubic root of 36409169 is about 331.4389839373.
The spelling of 36409169 in words is "thirty-six million, four hundred nine thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •