Base | Representation |
---|---|
bin | 1000101111001… |
… | …0000100011001 |
3 | 2112221122212202 |
4 | 2023302010121 |
5 | 33340034342 |
6 | 3345215545 |
7 | 623314121 |
oct | 213620431 |
9 | 75848782 |
10 | 36643097 |
11 | 19758557 |
12 | 103315b5 |
13 | 778c90a |
14 | 4c1bc81 |
15 | 333c332 |
hex | 22f2119 |
36643097 has 2 divisors, whose sum is σ = 36643098. Its totient is φ = 36643096.
The previous prime is 36643093. The next prime is 36643099. The reversal of 36643097 is 79034663.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36228361 + 414736 = 6019^2 + 644^2 .
It is an emirp because it is prime and its reverse (79034663) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 36643097 - 22 = 36643093 is a prime.
Together with 36643099, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 36643097.
It is not a weakly prime, because it can be changed into another prime (36643093) 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 as a sum of consecutive naturals, namely, 18321548 + 18321549.
It is an arithmetic number, because the mean of its divisors is an integer number (18321549).
Almost surely, 236643097 is an apocalyptic number.
It is an amenable number.
36643097 is a deficient number, since it is larger than the sum of its proper divisors (1).
36643097 is an equidigital number, since it uses as much as digits as its factorization.
36643097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 38.
The square root of 36643097 is about 6053.3541941638. The cubic root of 36643097 is about 332.1472981892.
The spelling of 36643097 in words is "thirty-six million, six hundred forty-three thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •