Base | Representation |
---|---|
bin | 1001000111010010001010… |
… | …00110011011010011111011 |
3 | 2121221221112222012222100221 |
4 | 10203221011012123103323 |
5 | 10111324421014401041 |
6 | 110342532144040511 |
7 | 4135643322212320 |
oct | 443510506332373 |
9 | 77857488188327 |
10 | 20041476715771 |
11 | 64275a7142535 |
12 | 22b820a003137 |
13 | b24b982952c4 |
14 | 4d40269cab47 |
15 | 24b4d13182d1 |
hex | 123a4519b4fb |
20041476715771 has 4 divisors (see below), whose sum is σ = 22904544818032. Its totient is φ = 17178408613512.
The previous prime is 20041476715769. The next prime is 20041476715781. The reversal of 20041476715771 is 17751767414002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20041476715771 - 21 = 20041476715769 is a prime.
It is a super-2 number, since 2×200414767157712 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20041476715781) 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 in 3 ways as a sum of consecutive naturals, for example, 1431534051120 + ... + 1431534051133.
It is an arithmetic number, because the mean of its divisors is an integer number (5726136204508).
Almost surely, 220041476715771 is an apocalyptic number.
20041476715771 is a deficient number, since it is larger than the sum of its proper divisors (2863068102261).
20041476715771 is an equidigital number, since it uses as much as digits as its factorization.
20041476715771 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2863068102260.
The product of its (nonzero) digits is 2304960, while the sum is 52.
The spelling of 20041476715771 in words is "twenty trillion, forty-one billion, four hundred seventy-six million, seven hundred fifteen thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •