Base | Representation |
---|---|
bin | 101101101111111000001001… |
… | …101110010111111011110110 |
3 | 222101101202001100002122010220 |
4 | 231233320021232113323312 |
5 | 202332444101440200042 |
6 | 1551531003135155210 |
7 | 60244244052131013 |
oct | 5557701156277366 |
9 | 871352040078126 |
10 | 201202201100022 |
11 | 59122413210471 |
12 | 1a696402075b06 |
13 | 88363948a1b25 |
14 | 379834a5d470a |
15 | 183dae71128ec |
hex | b6fe09b97ef6 |
201202201100022 has 64 divisors (see below), whose sum is σ = 408814536291840. Its totient is φ = 66001039847424.
The previous prime is 201202201100009. The next prime is 201202201100027. The reversal of 201202201100022 is 220001102202102.
It is a junction number, because it is equal to n+sod(n) for n = 201202201099974 and 201202201100010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201202201100027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4696684879 + ... + 4696727717.
It is an arithmetic number, because the mean of its divisors is an integer number (6387727129560).
Almost surely, 2201202201100022 is an apocalyptic number.
201202201100022 is an abundant number, since it is smaller than the sum of its proper divisors (207612335191818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201202201100022 is a wasteful number, since it uses less digits than its factorization.
201202201100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54197.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 201202201100022 its reverse (220001102202102), we get a palindrome (421203303302124).
The spelling of 201202201100022 in words is "two hundred one trillion, two hundred two billion, two hundred one million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •