Base | Representation |
---|---|
bin | 1001001100001111111110… |
… | …00110110011001001000101 |
3 | 2122120020222002002202202210 |
4 | 10212013333012303021011 |
5 | 10122123340340200401 |
6 | 110553151104454033 |
7 | 4154163464436051 |
oct | 446077706631105 |
9 | 78506862082683 |
10 | 20212101100101 |
11 | 64929a4162909 |
12 | 23252a791a319 |
13 | b37cba6a4b71 |
14 | 4dc3b1556c61 |
15 | 250b6a89b4d6 |
hex | 1261ff1b3245 |
20212101100101 has 8 divisors (see below), whose sum is σ = 27161668670464. Its totient is φ = 13368633798240.
The previous prime is 20212101100043. The next prime is 20212101100127. The reversal of 20212101100101 is 10100110121202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20212101100101 - 27 = 20212101099973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20212101100141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26525066680 + ... + 26525067441.
It is an arithmetic number, because the mean of its divisors is an integer number (3395208583808).
Almost surely, 220212101100101 is an apocalyptic number.
It is an amenable number.
20212101100101 is a deficient number, since it is larger than the sum of its proper divisors (6949567570363).
20212101100101 is a wasteful number, since it uses less digits than its factorization.
20212101100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53050134251.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20212101100101 its reverse (10100110121202), we get a palindrome (30312211221303).
The spelling of 20212101100101 in words is "twenty trillion, two hundred twelve billion, one hundred one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •