Base | Representation |
---|---|
bin | 1010001101000110100101… |
… | …0110100111000100000010 |
3 | 1110201122100120102002110000 |
4 | 2203101221112213010002 |
5 | 2432313003330041002 |
6 | 35510255431420430 |
7 | 2235430364225151 |
oct | 243215126470402 |
9 | 43648316362400 |
10 | 11220222112002 |
11 | 3636518965172 |
12 | 1312679824716 |
13 | 6350a7147977 |
14 | 2ab0c1239598 |
15 | 146ce512061c |
hex | a34695a7102 |
11220222112002 has 40 divisors (see below), whose sum is σ = 25308109582272. Its totient is φ = 3715305327000.
The previous prime is 11220222111997. The next prime is 11220222112007. The reversal of 11220222112002 is 20021122202211.
It is a happy number.
11220222112002 is a `hidden beast` number, since 11 + 220 + 22 + 211 + 200 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (11220222111997) and next prime (11220222112007).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (11220222112007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 229315374 + ... + 229364297.
Almost surely, 211220222112002 is an apocalyptic number.
11220222112002 is an abundant number, since it is smaller than the sum of its proper divisors (14087887470270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11220222112002 is a wasteful number, since it uses less digits than its factorization.
11220222112002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458679836 (or 458679827 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11220222112002 its reverse (20021122202211), we get a palindrome (31241344314213).
The spelling of 11220222112002 in words is "eleven trillion, two hundred twenty billion, two hundred twenty-two million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •