Base | Representation |
---|---|
bin | 1001001100001110010100… |
… | …00011101110011100110001 |
3 | 2122120011200001102011220012 |
4 | 10212013022003232130301 |
5 | 10122120030020231001 |
6 | 110552522513024305 |
7 | 4154132436535313 |
oct | 446071203563461 |
9 | 78504601364805 |
10 | 20211211102001 |
11 | 6492587842097 |
12 | 2325099855095 |
13 | b37ba81a0b7a |
14 | 4dc3292817b3 |
15 | 250b176982bb |
hex | 1261ca0ee731 |
20211211102001 has 8 divisors (see below), whose sum is σ = 20545549227624. Its totient is φ = 19876969969920.
The previous prime is 20211211101979. The next prime is 20211211102021. The reversal of 20211211102001 is 10020111211202.
It can be written as a sum of positive squares in 4 ways, for example, as 216854136976 + 19994356965025 = 465676^2 + 4471505^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20211211102001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20211211102021) 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, 23828126 + ... + 24661751.
It is an arithmetic number, because the mean of its divisors is an integer number (2568193653453).
Almost surely, 220211211102001 is an apocalyptic number.
It is an amenable number.
20211211102001 is a deficient number, since it is larger than the sum of its proper divisors (334338125623).
20211211102001 is an equidigital number, since it uses as much as digits as its factorization.
20211211102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48496771.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20211211102001 its reverse (10020111211202), we get a palindrome (30231322313203).
The spelling of 20211211102001 in words is "twenty trillion, two hundred eleven billion, two hundred eleven million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •