Base | Representation |
---|---|
bin | 1001001001010101110000… |
… | …10111110001111000101101 |
3 | 2122012200220221001212001212 |
4 | 10210222320113301320231 |
5 | 10114004120302340021 |
6 | 110435215055444205 |
7 | 4144024222231253 |
oct | 444527027617055 |
9 | 78180827055055 |
10 | 20112130121261 |
11 | 6454563149842 |
12 | 2309a47826665 |
13 | b2b747bb6a09 |
14 | 4d760a2cc5d3 |
15 | 24d268e9585b |
hex | 124ab85f1e2d |
20112130121261 has 2 divisors, whose sum is σ = 20112130121262. Its totient is φ = 20112130121260.
The previous prime is 20112130121203. The next prime is 20112130121267. The reversal of 20112130121261 is 16212103121102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14587778166025 + 5524351955236 = 3819395^2 + 2350394^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112130121261 - 214 = 20112130104877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20112130121267) 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, 10056065060630 + 10056065060631.
It is an arithmetic number, because the mean of its divisors is an integer number (10056065060631).
Almost surely, 220112130121261 is an apocalyptic number.
It is an amenable number.
20112130121261 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112130121261 is an equidigital number, since it uses as much as digits as its factorization.
20112130121261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 20112130121261 its reverse (16212103121102), we get a palindrome (36324233242363).
The spelling of 20112130121261 in words is "twenty trillion, one hundred twelve billion, one hundred thirty million, one hundred twenty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •