Base | Representation |
---|---|
bin | 101101101110011001001011… |
… | …010011000001001010100110 |
3 | 222101000222211020110002210120 |
4 | 231232121023103001022212 |
5 | 202324311223313310042 |
6 | 1551412055553302410 |
7 | 60234003654146556 |
oct | 5556311323011246 |
9 | 871028736402716 |
10 | 201100222010022 |
11 | 5909314171a7a5 |
12 | 1a67a6a1564a06 |
13 | 882989205971a |
14 | 379343479d166 |
15 | 183b129295dec |
hex | b6e64b4c12a6 |
201100222010022 has 32 divisors (see below), whose sum is σ = 413429606682624. Its totient is φ = 65165028300000.
The previous prime is 201100222010021. The next prime is 201100222010033. The reversal of 201100222010022 is 220010222001102.
It is a junction number, because it is equal to n+sod(n) for n = 201100222009983 and 201100222010010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201100222010021) 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 15 ways as a sum of consecutive naturals, for example, 393253104 + ... + 393764147.
It is an arithmetic number, because the mean of its divisors is an integer number (12919675208832).
Almost surely, 2201100222010022 is an apocalyptic number.
201100222010022 is an abundant number, since it is smaller than the sum of its proper divisors (212329384672602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201100222010022 is a wasteful number, since it uses less digits than its factorization.
201100222010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787018444.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 201100222010022 its reverse (220010222001102), we get a palindrome (421110444011124).
The spelling of 201100222010022 in words is "two hundred one trillion, one hundred billion, two hundred twenty-two million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •