Base | Representation |
---|---|
bin | 1001001011111001101010… |
… | …00011000010001101110001 |
3 | 2122112010001011202211021212 |
4 | 10211330311003002031301 |
5 | 10121424322010243131 |
6 | 110543450233325505 |
7 | 4153260556006244 |
oct | 445746503021561 |
9 | 78463034684255 |
10 | 20200121181041 |
11 | 648890687735a |
12 | 2322b03866895 |
13 | b36b2b751569 |
14 | 4db99648525b |
15 | 2506b8c95a2b |
hex | 125f350c2371 |
20200121181041 has 2 divisors, whose sum is σ = 20200121181042. Its totient is φ = 20200121181040.
The previous prime is 20200121181011. The next prime is 20200121181049. The reversal of 20200121181041 is 14018112100202.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16513625180416 + 3686496000625 = 4063696^2 + 1920025^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200121181041 - 210 = 20200121180017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20200121180998 and 20200121181016.
It is not a weakly prime, because it can be changed into another prime (20200121181049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100060590520 + 10100060590521.
It is an arithmetic number, because the mean of its divisors is an integer number (10100060590521).
Almost surely, 220200121181041 is an apocalyptic number.
It is an amenable number.
20200121181041 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200121181041 is an equidigital number, since it uses as much as digits as its factorization.
20200121181041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 23.
Adding to 20200121181041 its reverse (14018112100202), we get a palindrome (34218233281243).
The spelling of 20200121181041 in words is "twenty trillion, two hundred billion, one hundred twenty-one million, one hundred eighty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •