Base | Representation |
---|---|
bin | 11101011011010101001… |
… | …110111110000000000101 |
3 | 21011022200102211110002012 |
4 | 131123111032332000011 |
5 | 231112442244200401 |
6 | 4144554051224005 |
7 | 266046205145264 |
oct | 35332516760005 |
9 | 7138612743065 |
10 | 2022212100101 |
11 | 70a685014406 |
12 | 287b028a8005 |
13 | 11890331907b |
14 | 6dc388825db |
15 | 379080558bb |
hex | 1d6d53be005 |
2022212100101 has 8 divisors (see below), whose sum is σ = 2027248711320. Its totient is φ = 2017177178112.
The previous prime is 2022212100091. The next prime is 2022212100109. The reversal of 2022212100101 is 1010012122202.
It can be written as a sum of positive squares in 4 ways, for example, as 35730450625 + 1986481649476 = 189025^2 + 1409426^2 .
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 2022212100101 - 210 = 2022212099077 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 (2022212100109) 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, 1992071 + ... + 2830683.
It is an arithmetic number, because the mean of its divisors is an integer number (253406088915).
Almost surely, 22022212100101 is an apocalyptic number.
It is an amenable number.
2022212100101 is a deficient number, since it is larger than the sum of its proper divisors (5036611219).
2022212100101 is an equidigital number, since it uses as much as digits as its factorization.
2022212100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 844615.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2022212100101 its reverse (1010012122202), we get a palindrome (3032224222303).
The spelling of 2022212100101 in words is "two trillion, twenty-two billion, two hundred twelve million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •