Base | Representation |
---|---|
bin | 1000101010100… |
… | …0110101111001 |
3 | 2112101102110000 |
4 | 2022220311321 |
5 | 33300440121 |
6 | 3334543213 |
7 | 620624511 |
oct | 212506571 |
9 | 75342400 |
10 | 36343161 |
11 | 19573178 |
12 | 10207b09 |
13 | 76b623a |
14 | 4b80841 |
15 | 32cd526 |
hex | 22a8d79 |
36343161 has 20 divisors (see below), whose sum is σ = 57486132. Its totient is φ = 22802688.
The previous prime is 36343159. The next prime is 36343163. The reversal of 36343161 is 16134363.
36343161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (36343159) and next prime (36343163).
It can be written as a sum of positive squares in 2 ways, for example, as 22325625 + 14017536 = 4725^2 + 3744^2 .
It is not a de Polignac number, because 36343161 - 21 = 36343159 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (36343163) 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 19 ways as a sum of consecutive naturals, for example, 11820 + ... + 14573.
Almost surely, 236343161 is an apocalyptic number.
It is an amenable number.
36343161 is a deficient number, since it is larger than the sum of its proper divisors (21142971).
36343161 is a wasteful number, since it uses less digits than its factorization.
36343161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26422 (or 26413 counting only the distinct ones).
The product of its digits is 3888, while the sum is 27.
The square root of 36343161 is about 6028.5289250364. The cubic root of 36343161 is about 331.2385686811.
The spelling of 36343161 in words is "thirty-six million, three hundred forty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •