Base | Representation |
---|---|
bin | 1001000111010010001010… |
… | …00110011011001010101101 |
3 | 2121221221112222012221120002 |
4 | 10203221011012123022231 |
5 | 10111324421014341211 |
6 | 110342532144034045 |
7 | 4135643322210515 |
oct | 443510506331255 |
9 | 77857488187502 |
10 | 20041476715181 |
11 | 64275a7142049 |
12 | 22b820a002925 |
13 | b24b98294c5c |
14 | 4d40269ca845 |
15 | 24b4d131803b |
hex | 123a4519b2ad |
20041476715181 has 2 divisors, whose sum is σ = 20041476715182. Its totient is φ = 20041476715180.
The previous prime is 20041476715157. The next prime is 20041476715231. The reversal of 20041476715181 is 18151767414002.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19521153975625 + 520322739556 = 4418275^2 + 721334^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20041476715181 is a prime.
It is a super-2 number, since 2×200414767151812 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20041476715781) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10020738357590 + 10020738357591.
It is an arithmetic number, because the mean of its divisors is an integer number (10020738357591).
Almost surely, 220041476715181 is an apocalyptic number.
It is an amenable number.
20041476715181 is a deficient number, since it is larger than the sum of its proper divisors (1).
20041476715181 is an equidigital number, since it uses as much as digits as its factorization.
20041476715181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 376320, while the sum is 47.
The spelling of 20041476715181 in words is "twenty trillion, forty-one billion, four hundred seventy-six million, seven hundred fifteen thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •