Base | Representation |
---|---|
bin | 1000100101000111000111… |
… | …11100100110101101001001 |
3 | 2110210200212000111020102201 |
4 | 10102203203330212231021 |
5 | 4433110233043213431 |
6 | 104043305533200201 |
7 | 3655055536450456 |
oct | 422434374465511 |
9 | 73720760436381 |
10 | 18867320679241 |
11 | 6014649720741 |
12 | 2148743630061 |
13 | a6b24701a598 |
14 | 49327c97a82d |
15 | 22abb045d461 |
hex | 1128e3f26b49 |
18867320679241 has 2 divisors, whose sum is σ = 18867320679242. Its totient is φ = 18867320679240.
The previous prime is 18867320679161. The next prime is 18867320679247. The reversal of 18867320679241 is 14297602376881.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16115238755641 + 2752081923600 = 4014379^2 + 1658940^2 .
It is an emirp because it is prime and its reverse (14297602376881) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 18867320679241 - 233 = 18858730744649 is a prime.
It is a super-2 number, since 2×188673206792412 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (18867320679247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9433660339620 + 9433660339621.
It is an arithmetic number, because the mean of its divisors is an integer number (9433660339621).
Almost surely, 218867320679241 is an apocalyptic number.
It is an amenable number.
18867320679241 is a deficient number, since it is larger than the sum of its proper divisors (1).
18867320679241 is an equidigital number, since it uses as much as digits as its factorization.
18867320679241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48771072, while the sum is 64.
The spelling of 18867320679241 in words is "eighteen trillion, eight hundred sixty-seven billion, three hundred twenty million, six hundred seventy-nine thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •