Base | Representation |
---|---|
bin | 11101000110101010010… |
… | …111111101010110000101 |
3 | 21002012101201002111120222 |
4 | 131012222113331112011 |
5 | 230232014124344231 |
6 | 4130443511034125 |
7 | 264332213126066 |
oct | 35065227752605 |
9 | 7065351074528 |
10 | 2000018199941 |
11 | 701226151763 |
12 | 28374a06b945 |
13 | 1167a7267378 |
14 | 6cb3106a56d |
15 | 370598c527b |
hex | 1d1aa5fd585 |
2000018199941 has 2 divisors, whose sum is σ = 2000018199942. Its totient is φ = 2000018199940.
The previous prime is 2000018199871. The next prime is 2000018200049. The reversal of 2000018199941 is 1499918100002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1099815735841 + 900202464100 = 1048721^2 + 948790^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000018199941 - 210 = 2000018198917 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2000018199892 and 2000018199901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000018199241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000009099970 + 1000009099971.
It is an arithmetic number, because the mean of its divisors is an integer number (1000009099971).
Almost surely, 22000018199941 is an apocalyptic number.
It is an amenable number.
2000018199941 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000018199941 is an equidigital number, since it uses as much as digits as its factorization.
2000018199941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 44.
The spelling of 2000018199941 in words is "two trillion, eighteen million, one hundred ninety-nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •