Base | Representation |
---|---|
bin | 1001000111000100110010… |
… | …11110000001000010000101 |
3 | 2121221021000222012102002201 |
4 | 10203202121132001002011 |
5 | 10111220222334014031 |
6 | 110335344214234501 |
7 | 4135300454240653 |
oct | 443423136010205 |
9 | 77837028172081 |
10 | 20034302251141 |
11 | 6424555367022 |
12 | 22b6947355a31 |
13 | b242c3aa5b69 |
14 | 4d3945c17dd3 |
15 | 24b21153ad61 |
hex | 123899781085 |
20034302251141 has 2 divisors, whose sum is σ = 20034302251142. Its totient is φ = 20034302251140.
The previous prime is 20034302251109. The next prime is 20034302251199. The reversal of 20034302251141 is 14115220343002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19599125868100 + 435176383041 = 4427090^2 + 659679^2 .
It is a cyclic number.
It is not a de Polignac number, because 20034302251141 - 25 = 20034302251109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20034302251541) 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, 10017151125570 + 10017151125571.
It is an arithmetic number, because the mean of its divisors is an integer number (10017151125571).
Almost surely, 220034302251141 is an apocalyptic number.
It is an amenable number.
20034302251141 is a deficient number, since it is larger than the sum of its proper divisors (1).
20034302251141 is an equidigital number, since it uses as much as digits as its factorization.
20034302251141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 20034302251141 its reverse (14115220343002), we get a palindrome (34149522594143).
The spelling of 20034302251141 in words is "twenty trillion, thirty-four billion, three hundred two million, two hundred fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.202 sec. • engine limits •