Base | Representation |
---|---|
bin | 1001001100100000111011… |
… | …00000100010110110101001 |
3 | 2122121010110021100200010112 |
4 | 10212100131200202312221 |
5 | 10122301004440201301 |
6 | 111001254101224105 |
7 | 4154635133242433 |
oct | 446203540426651 |
9 | 78533407320115 |
10 | 20221201100201 |
11 | 6496843945652 |
12 | 2327007402035 |
13 | b38b0aa989ca |
14 | 4dc9d5d5d653 |
15 | 250eee72c9bb |
hex | 12641d822da9 |
20221201100201 has 8 divisors (see below), whose sum is σ = 20243296792800. Its totient is φ = 20199117169440.
The previous prime is 20221201100197. The next prime is 20221201100249. The reversal of 20221201100201 is 10200110212202.
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 20221201100201 - 22 = 20221201100197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20221201100281) 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 in 7 ways as a sum of consecutive naturals, for example, 502061 + ... + 6379221.
It is an arithmetic number, because the mean of its divisors is an integer number (2530412099100).
Almost surely, 220221201100201 is an apocalyptic number.
It is an amenable number.
20221201100201 is a deficient number, since it is larger than the sum of its proper divisors (22095692599).
20221201100201 is a wasteful number, since it uses less digits than its factorization.
20221201100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5880919.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20221201100201 its reverse (10200110212202), we get a palindrome (30421311312403).
The spelling of 20221201100201 in words is "twenty trillion, two hundred twenty-one billion, two hundred one million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •