Base | Representation |
---|---|
bin | 1000010000101110000101… |
… | …00001100100110110111101 |
3 | 2101022201101011222000011112 |
4 | 10020113002201210312331 |
5 | 4340120330122321123 |
6 | 102345354021531405 |
7 | 3553333162341344 |
oct | 410270241446675 |
9 | 71281334860145 |
10 | 18166680276413 |
11 | 587449a458a09 |
12 | 20549a8573b65 |
13 | a1a158ca9a76 |
14 | 46b3b45b2b5b |
15 | 217855056d78 |
hex | 1085c2864dbd |
18166680276413 has 2 divisors, whose sum is σ = 18166680276414. Its totient is φ = 18166680276412.
The previous prime is 18166680276383. The next prime is 18166680276499. The reversal of 18166680276413 is 31467208666181.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15229014538969 + 2937665737444 = 3902437^2 + 1713962^2 .
It is an emirp because it is prime and its reverse (31467208666181) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 18166680276413 - 222 = 18166676082109 is a prime.
It is a super-2 number, since 2×181666802764132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (18166680236413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9083340138206 + 9083340138207.
It is an arithmetic number, because the mean of its divisors is an integer number (9083340138207).
Almost surely, 218166680276413 is an apocalyptic number.
It is an amenable number.
18166680276413 is a deficient number, since it is larger than the sum of its proper divisors (1).
18166680276413 is an equidigital number, since it uses as much as digits as its factorization.
18166680276413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13934592, while the sum is 59.
The spelling of 18166680276413 in words is "eighteen trillion, one hundred sixty-six billion, six hundred eighty million, two hundred seventy-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •