Base | Representation |
---|---|
bin | 1010000001011101000101… |
… | …0001110100000100101010 |
3 | 1110000111210212112100221200 |
4 | 2200113101101310010222 |
5 | 2421023132132101442 |
6 | 35234322015545030 |
7 | 2215114256226030 |
oct | 240272121640452 |
9 | 43014725470850 |
10 | 11020102222122 |
11 | 3569665457a24 |
12 | 129b929b2b176 |
13 | 61c26403ca46 |
14 | 2a153926a550 |
15 | 1419d13b834c |
hex | a05d147412a |
11020102222122 has 96 divisors (see below), whose sum is σ = 27319151059200. Its totient is φ = 3144993433344.
The previous prime is 11020102222039. The next prime is 11020102222211. The reversal of 11020102222122 is 22122220102011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11020102222095 and 11020102222104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 500061688 + ... + 500083724.
It is an arithmetic number, because the mean of its divisors is an integer number (284574490200).
Almost surely, 211020102222122 is an apocalyptic number.
11020102222122 is an abundant number, since it is smaller than the sum of its proper divisors (16299048837078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020102222122 is a wasteful number, since it uses less digits than its factorization.
11020102222122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26420 (or 26417 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11020102222122 its reverse (22122220102011), we get a palindrome (33142322324133).
The spelling of 11020102222122 in words is "eleven trillion, twenty billion, one hundred two million, two hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •