Base | Representation |
---|---|
bin | 1001000110000111001100… |
… | …01110100100101011101001 |
3 | 2121211002200010111201212021 |
4 | 10203003212032210223221 |
5 | 10110200004424410441 |
6 | 110312234403544441 |
7 | 4133020063336564 |
oct | 443034616445351 |
9 | 77732603451767 |
10 | 20001230310121 |
11 | 6411524096265 |
12 | 22b045768b121 |
13 | b2115315b3a8 |
14 | 4d20c97db4db |
15 | 24a427dac3d1 |
hex | 1230e63a4ae9 |
20001230310121 has 2 divisors, whose sum is σ = 20001230310122. Its totient is φ = 20001230310120.
The previous prime is 20001230310091. The next prime is 20001230310143. The reversal of 20001230310121 is 12101303210002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17221794507225 + 2779435802896 = 4149915^2 + 1667164^2 .
It is a cyclic number.
It is not a de Polignac number, because 20001230310121 - 27 = 20001230309993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20001230310095 and 20001230310104.
It is not a weakly prime, because it can be changed into another prime (20001230310421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000615155060 + 10000615155061.
It is an arithmetic number, because the mean of its divisors is an integer number (10000615155061).
Almost surely, 220001230310121 is an apocalyptic number.
It is an amenable number.
20001230310121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001230310121 is an equidigital number, since it uses as much as digits as its factorization.
20001230310121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 20001230310121 its reverse (12101303210002), we get a palindrome (32102533520123).
The spelling of 20001230310121 in words is "twenty trillion, one billion, two hundred thirty million, three hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •