Base | Representation |
---|---|
bin | 101101101110100011010011… |
… | …101100000001110000100110 |
3 | 222101002000220100200111212120 |
4 | 231232203103230001300212 |
5 | 202330001013122431042 |
6 | 1551421055230530410 |
7 | 60234540354231213 |
oct | 5556432354016046 |
9 | 871060810614776 |
10 | 201111100202022 |
11 | 5909781412141a |
12 | 1a680818666a06 |
13 | 882a90697621a |
14 | 3793b87402b0a |
15 | 183b5642c3dec |
hex | b6e8d3b01c26 |
201111100202022 has 32 divisors (see below), whose sum is σ = 425885853773952. Its totient is φ = 63093156430464.
The previous prime is 201111100201961. The next prime is 201111100202029. The reversal of 201111100202022 is 220202001111102.
It is a junction number, because it is equal to n+sod(n) for n = 201111100201992 and 201111100202010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201111100202029) 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, 4323453 + ... + 20516199.
It is an arithmetic number, because the mean of its divisors is an integer number (13308932930436).
Almost surely, 2201111100202022 is an apocalyptic number.
201111100202022 is an abundant number, since it is smaller than the sum of its proper divisors (224774753571930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201111100202022 is a wasteful number, since it uses less digits than its factorization.
201111100202022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16314532.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201111100202022 its reverse (220202001111102), we get a palindrome (421313101313124).
The spelling of 201111100202022 in words is "two hundred one trillion, one hundred eleven billion, one hundred million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •