Base | Representation |
---|---|
bin | 1000101111011… |
… | …1111010110101 |
3 | 2112222212202022 |
4 | 2023313322311 |
5 | 33341321221 |
6 | 3345522525 |
7 | 623444024 |
oct | 213677265 |
9 | 75885668 |
10 | 36667061 |
11 | 19774562 |
12 | 10343445 |
13 | 779a7b2 |
14 | 4c268bb |
15 | 33444ab |
hex | 22f7eb5 |
36667061 has 2 divisors, whose sum is σ = 36667062. Its totient is φ = 36667060.
The previous prime is 36666967. The next prime is 36667063. The reversal of 36667061 is 16076663.
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., 32706961 + 3960100 = 5719^2 + 1990^2 .
It is an emirp because it is prime and its reverse (16076663) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 36667061 - 210 = 36666037 is a prime.
Together with 36667063, it forms a pair of twin primes.
It is a Chen prime.
It is a plaindrome in base 15.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (36667063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 18333530 + 18333531.
It is an arithmetic number, because the mean of its divisors is an integer number (18333531).
Almost surely, 236667061 is an apocalyptic number.
It is an amenable number.
36667061 is a deficient number, since it is larger than the sum of its proper divisors (1).
36667061 is an equidigital number, since it uses as much as digits as its factorization.
36667061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 35.
The square root of 36667061 is about 6055.3332691108. Note that the first 3 decimals coincide. The cubic root of 36667061 is about 332.2196887529.
The spelling of 36667061 in words is "thirty-six million, six hundred sixty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •