Base | Representation |
---|---|
bin | 1001100011110001001101… |
… | …01111110000011111001001 |
3 | 2202102111212021101100221010 |
4 | 10301320212233300133021 |
5 | 10223343402310001301 |
6 | 112412320013234133 |
7 | 4266442434651552 |
oct | 461704657603711 |
9 | 82374767340833 |
10 | 21020220000201 |
11 | 67746972153a4 |
12 | 2435a39192949 |
13 | b962766c4a26 |
14 | 529553c97329 |
15 | 266bb68235d6 |
hex | 131e26bf07c9 |
21020220000201 has 8 divisors (see below), whose sum is σ = 28304454654144. Its totient is φ = 13874732673200.
The previous prime is 21020220000139. The next prime is 21020220000203. The reversal of 21020220000201 is 10200002202012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21020220000201 - 211 = 21020219998153 is a prime.
It is a super-3 number, since 3×210202200002013 (a number of 41 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (21020220000203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34686831381 + ... + 34686831986.
It is an arithmetic number, because the mean of its divisors is an integer number (3538056831768).
Almost surely, 221020220000201 is an apocalyptic number.
It is an amenable number.
21020220000201 is a deficient number, since it is larger than the sum of its proper divisors (7284234653943).
21020220000201 is a wasteful number, since it uses less digits than its factorization.
21020220000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69373663471.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 21020220000201 its reverse (10200002202012), we get a palindrome (31220222202213).
The spelling of 21020220000201 in words is "twenty-one trillion, twenty billion, two hundred twenty million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •