Base | Representation |
---|---|
bin | 1010001101001101010010… |
… | …0101101010101010001010 |
3 | 1110201210222221202022000200 |
4 | 2203103110211222222022 |
5 | 2432330144413033002 |
6 | 35511154140513030 |
7 | 2235523101341664 |
oct | 243232445525212 |
9 | 43653887668020 |
10 | 11222021221002 |
11 | 3637261470409 |
12 | 1312aa024b776 |
13 | 635302ab52c7 |
14 | 2ab21215d534 |
15 | 146d9d04eb1c |
hex | a34d496aa8a |
11222021221002 has 12 divisors (see below), whose sum is σ = 24314379312210. Its totient is φ = 3740673740328.
The previous prime is 11222021220961. The next prime is 11222021221039. The reversal of 11222021221002 is 20012212022211.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 10516990626081 + 705030594921 = 3242991^2 + 839661^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 623445623389 = 11222021221002 / (1 + 1 + 2 + 2 + 2 + 0 + 2 + 1 + 2 + 2 + 1 + 0 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 311722811677 + ... + 311722811712.
Almost surely, 211222021221002 is an apocalyptic number.
11222021221002 is an abundant number, since it is smaller than the sum of its proper divisors (13092358091208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222021221002 is a wasteful number, since it uses less digits than its factorization.
11222021221002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 623445623397 (or 623445623394 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11222021221002 its reverse (20012212022211), we get a palindrome (31234233243213).
The spelling of 11222021221002 in words is "eleven trillion, two hundred twenty-two billion, twenty-one million, two hundred twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •