Base | Representation |
---|---|
bin | 1001101001100101010111… |
… | …10100000101100000001001 |
3 | 2210010121120202012210202011 |
4 | 10310302223310011200021 |
5 | 10240132100334001301 |
6 | 113044202034135521 |
7 | 4320044621304622 |
oct | 464625364054011 |
9 | 83117522183664 |
10 | 21220021000201 |
11 | 68413a6716991 |
12 | 24686ba1215a1 |
13 | bac068719b0a |
14 | 5350a9776a49 |
15 | 26beac589a51 |
hex | 134cabd05809 |
21220021000201 has 2 divisors, whose sum is σ = 21220021000202. Its totient is φ = 21220021000200.
The previous prime is 21220021000159. The next prime is 21220021000223. The reversal of 21220021000201 is 10200012002212.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18500493488400 + 2719527511801 = 4301220^2 + 1649099^2 .
It is a cyclic number.
It is not a de Polignac number, because 21220021000201 - 29 = 21220020999689 is a prime.
It is not a weakly prime, because it can be changed into another prime (21220021000231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10610010500100 + 10610010500101.
It is an arithmetic number, because the mean of its divisors is an integer number (10610010500101).
Almost surely, 221220021000201 is an apocalyptic number.
It is an amenable number.
21220021000201 is a deficient number, since it is larger than the sum of its proper divisors (1).
21220021000201 is an equidigital number, since it uses as much as digits as its factorization.
21220021000201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 21220021000201 its reverse (10200012002212), we get a palindrome (31420033002413).
The spelling of 21220021000201 in words is "twenty-one trillion, two hundred twenty billion, twenty-one million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •