Base | Representation |
---|---|
bin | 100011100010… |
… | …1110100101101 |
3 | 1022001210220002 |
4 | 1013011310231 |
5 | 14232323302 |
6 | 1503234045 |
7 | 314255405 |
oct | 107056455 |
9 | 38053802 |
10 | 18636077 |
11 | a579619 |
12 | 62a8925 |
13 | 3b26685 |
14 | 2691805 |
15 | 1981c02 |
hex | 11c5d2d |
18636077 has 2 divisors, whose sum is σ = 18636078. Its totient is φ = 18636076.
The previous prime is 18636047. The next prime is 18636091. The reversal of 18636077 is 77063681.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11095561 + 7540516 = 3331^2 + 2746^2 .
It is an emirp because it is prime and its reverse (77063681) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 18636077 - 214 = 18619693 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 18636077.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (18636047) 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, 9318038 + 9318039.
It is an arithmetic number, because the mean of its divisors is an integer number (9318039).
Almost surely, 218636077 is an apocalyptic number.
It is an amenable number.
18636077 is a deficient number, since it is larger than the sum of its proper divisors (1).
18636077 is an equidigital number, since it uses as much as digits as its factorization.
18636077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42336, while the sum is 38.
The square root of 18636077 is about 4316.9522814134. The cubic root of 18636077 is about 265.1254988812.
It can be divided in two parts, 186 and 36077, that added together give a palindrome (36263).
The spelling of 18636077 in words is "eighteen million, six hundred thirty-six thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •