Base | Representation |
---|---|
bin | 1010001101001101111111… |
… | …0101110101101111110110 |
3 | 1110201211111002222202222120 |
4 | 2203103133311311233312 |
5 | 2432331041230310402 |
6 | 35511225003140410 |
7 | 2235530553124350 |
oct | 243233765655766 |
9 | 43654432882876 |
10 | 11222210010102 |
11 | 3637348a96463 |
12 | 1312b33514706 |
13 | 635332c45830 |
14 | 2ab22d2640d0 |
15 | 146dae8e23bc |
hex | a34dfd75bf6 |
11222210010102 has 128 divisors (see below), whose sum is σ = 28373108434944. Its totient is φ = 2879446330368.
The previous prime is 11222210010079. The next prime is 11222210010127. The reversal of 11222210010102 is 20101001222211.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 315274818 + ... + 315310410.
It is an arithmetic number, because the mean of its divisors is an integer number (221664909648).
Almost surely, 211222210010102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11222210010102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14186554217472).
11222210010102 is an abundant number, since it is smaller than the sum of its proper divisors (17150898424842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222210010102 is a wasteful number, since it uses less digits than its factorization.
11222210010102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51262.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11222210010102 its reverse (20101001222211), we get a palindrome (31323211232313).
The spelling of 11222210010102 in words is "eleven trillion, two hundred twenty-two billion, two hundred ten million, ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •