Base | Representation |
---|---|
bin | 1001001001000001000101… |
… | …10000010000010001111101 |
3 | 2122011122021100021022000112 |
4 | 10210200202300100101331 |
5 | 10113313402141121341 |
6 | 110430141414035405 |
7 | 4143152156022533 |
oct | 444404260202175 |
9 | 78148240238015 |
10 | 20101030020221 |
11 | 644a887460617 |
12 | 230786a348b65 |
13 | b2a6993118a7 |
14 | 4d6c76002153 |
15 | 24cd19731aeb |
hex | 124822c1047d |
20101030020221 has 2 divisors, whose sum is σ = 20101030020222. Its totient is φ = 20101030020220.
The previous prime is 20101030020179. The next prime is 20101030020233. The reversal of 20101030020221 is 12202003010102.
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., 14723037117721 + 5377992902500 = 3837061^2 + 2319050^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20101030020221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20101030020196 and 20101030020205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20101030020521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050515010110 + 10050515010111.
It is an arithmetic number, because the mean of its divisors is an integer number (10050515010111).
Almost surely, 220101030020221 is an apocalyptic number.
It is an amenable number.
20101030020221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101030020221 is an equidigital number, since it uses as much as digits as its factorization.
20101030020221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 20101030020221 its reverse (12202003010102), we get a palindrome (32303033030323).
The spelling of 20101030020221 in words is "twenty trillion, one hundred one billion, thirty million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.994 sec. • engine limits •