Base | Representation |
---|---|
bin | 1001000110001100011001… |
… | …00101000110000101000101 |
3 | 2121211100212122010020212002 |
4 | 10203012030211012011011 |
5 | 10110221213413410231 |
6 | 110313415343035045 |
7 | 4133146202645105 |
oct | 443061445060505 |
9 | 77740778106762 |
10 | 20004021231941 |
11 | 641272653311a |
12 | 22b0ab629ba85 |
13 | b214a942a516 |
14 | 4d22b233b205 |
15 | 24a53ce020cb |
hex | 12318c946145 |
20004021231941 has 2 divisors, whose sum is σ = 20004021231942. Its totient is φ = 20004021231940.
The previous prime is 20004021231937. The next prime is 20004021231983. The reversal of 20004021231941 is 14913212040002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18402847341316 + 1601173890625 = 4289854^2 + 1265375^2 .
It is a cyclic number.
It is not a de Polignac number, because 20004021231941 - 22 = 20004021231937 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20004021231041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10002010615970 + 10002010615971.
It is an arithmetic number, because the mean of its divisors is an integer number (10002010615971).
Almost surely, 220004021231941 is an apocalyptic number.
It is an amenable number.
20004021231941 is a deficient number, since it is larger than the sum of its proper divisors (1).
20004021231941 is an equidigital number, since it uses as much as digits as its factorization.
20004021231941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 20004021231941 its reverse (14913212040002), we get a palindrome (34917233271943).
The spelling of 20004021231941 in words is "twenty trillion, four billion, twenty-one million, two hundred thirty-one thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •