Base | Representation |
---|---|
bin | 1001010010111000101110… |
… | …10110000100001111111001 |
3 | 2200101001120120110002020112 |
4 | 10221130113112010033321 |
5 | 10134342402100202301 |
6 | 111250023211434105 |
7 | 4206515515002065 |
oct | 451342726041771 |
9 | 80331516402215 |
10 | 20440141022201 |
11 | 657068480854a |
12 | 2361529a55935 |
13 | b5365cc7c004 |
14 | 50944561aaa5 |
15 | 256a658209bb |
hex | 1297175843f9 |
20440141022201 has 2 divisors, whose sum is σ = 20440141022202. Its totient is φ = 20440141022200.
The previous prime is 20440141022101. The next prime is 20440141022221. The reversal of 20440141022201 is 10222014104402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14078824734976 + 6361316287225 = 3752176^2 + 2522165^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20440141022201 is a prime.
It is not a weakly prime, because it can be changed into another prime (20440141022221) 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, 10220070511100 + 10220070511101.
It is an arithmetic number, because the mean of its divisors is an integer number (10220070511101).
Almost surely, 220440141022201 is an apocalyptic number.
It is an amenable number.
20440141022201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20440141022201 is an equidigital number, since it uses as much as digits as its factorization.
20440141022201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 20440141022201 its reverse (10222014104402), we get a palindrome (30662155126603).
The spelling of 20440141022201 in words is "twenty trillion, four hundred forty billion, one hundred forty-one million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •