Base | Representation |
---|---|
bin | 100010001001010000… |
… | …110111111001110001 |
3 | 10111122002020002120111 |
4 | 202021100313321301 |
5 | 1100041113441431 |
6 | 24501555341321 |
7 | 2435351204653 |
oct | 421120677161 |
9 | 114562202514 |
10 | 36662640241 |
11 | 14604117287 |
12 | 71322b1841 |
13 | 35c381c386 |
14 | 1abb2686d3 |
15 | e48a047b1 |
hex | 889437e71 |
36662640241 has 2 divisors, whose sum is σ = 36662640242. Its totient is φ = 36662640240.
The previous prime is 36662640239. The next prime is 36662640337. The reversal of 36662640241 is 14204626663.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 34690925025 + 1971715216 = 186255^2 + 44404^2 .
It is an emirp because it is prime and its reverse (14204626663) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 36662640241 - 21 = 36662640239 is a prime.
Together with 36662640239, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 36662640194 and 36662640203.
It is not a weakly prime, because it can be changed into another prime (36662640041) 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, 18331320120 + 18331320121.
It is an arithmetic number, because the mean of its divisors is an integer number (18331320121).
Almost surely, 236662640241 is an apocalyptic number.
It is an amenable number.
36662640241 is a deficient number, since it is larger than the sum of its proper divisors (1).
36662640241 is an equidigital number, since it uses as much as digits as its factorization.
36662640241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 248832, while the sum is 40.
The spelling of 36662640241 in words is "thirty-six billion, six hundred sixty-two million, six hundred forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •