Base | Representation |
---|---|
bin | 1001001000100001100011… |
… | …10100001100010000111001 |
3 | 2122010000120122210111222122 |
4 | 10210100301310030100321 |
5 | 10113024220311411101 |
6 | 110414302013531025 |
7 | 4142012535255134 |
oct | 444206164142071 |
9 | 78100518714878 |
10 | 20084102841401 |
11 | 644369050a635 |
12 | 23045254a3a75 |
13 | b28bcc437151 |
14 | 4d610bc7b21b |
15 | 24c67864151b |
hex | 124431d0c439 |
20084102841401 has 2 divisors, whose sum is σ = 20084102841402. Its totient is φ = 20084102841400.
The previous prime is 20084102841367. The next prime is 20084102841409. The reversal of 20084102841401 is 10414820148002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14512137870400 + 5571964971001 = 3809480^2 + 2360501^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20084102841401 is a prime.
It is not a weakly prime, because it can be changed into another prime (20084102841409) 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, 10042051420700 + 10042051420701.
It is an arithmetic number, because the mean of its divisors is an integer number (10042051420701).
Almost surely, 220084102841401 is an apocalyptic number.
It is an amenable number.
20084102841401 is a deficient number, since it is larger than the sum of its proper divisors (1).
20084102841401 is an equidigital number, since it uses as much as digits as its factorization.
20084102841401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16384, while the sum is 35.
Adding to 20084102841401 its reverse (10414820148002), we get a palindrome (30498922989403).
The spelling of 20084102841401 in words is "twenty trillion, eighty-four billion, one hundred two million, eight hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •