Base | Representation |
---|---|
bin | 1001001100001101111011… |
… | …00110111010001010010001 |
3 | 2122120011010111100221022021 |
4 | 10212012331212322022101 |
5 | 10122114113032034301 |
6 | 110552450052011441 |
7 | 4154124322222351 |
oct | 446067546721221 |
9 | 78504114327267 |
10 | 20211002221201 |
11 | 649248a943930 |
12 | 232503b900b81 |
13 | b37b73b2756c |
14 | 4dc30962ab61 |
15 | 250b041878a1 |
hex | 1261bd9ba291 |
20211002221201 has 8 divisors (see below), whose sum is σ = 22048403989824. Its totient is φ = 18373606774320.
The previous prime is 20211002221199. The next prime is 20211002221211. The reversal of 20211002221201 is 10212220011202.
It is a happy number.
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 20211002221201 - 21 = 20211002221199 is a prime.
It is a super-2 number, since 2×202110022212012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20211002221211) 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, 7249075 + ... + 9642151.
It is an arithmetic number, because the mean of its divisors is an integer number (2756050498728).
Almost surely, 220211002221201 is an apocalyptic number.
It is an amenable number.
20211002221201 is a deficient number, since it is larger than the sum of its proper divisors (1837401768623).
20211002221201 is a wasteful number, since it uses less digits than its factorization.
20211002221201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3160871.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20211002221201 its reverse (10212220011202), we get a palindrome (30423222232403).
The spelling of 20211002221201 in words is "twenty trillion, two hundred eleven billion, two million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •