Base | Representation |
---|---|
bin | 1010001101001101111111… |
… | …0110010001000100010010 |
3 | 1110201211111010012110111000 |
4 | 2203103133312101010102 |
5 | 2432331041242401002 |
6 | 35511225005402430 |
7 | 2235530554101525 |
oct | 243233766210422 |
9 | 43654433173430 |
10 | 11222210122002 |
11 | 3637349062540 |
12 | 1312b33569416 |
13 | 635332c84749 |
14 | 2ab22d292bbc |
15 | 146dae91561c |
hex | a34dfd91112 |
11222210122002 has 64 divisors (see below), whose sum is σ = 27368264448000. Its totient is φ = 3380306412240.
The previous prime is 11222210122001. The next prime is 11222210122031. The reversal of 11222210122002 is 20022101222211.
It is a happy number.
11222210122002 is a `hidden beast` number, since 11 + 222 + 210 + 1 + 220 + 0 + 2 = 666.
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 (11222210122001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 56465502 + ... + 56663897.
It is an arithmetic number, because the mean of its divisors is an integer number (427629132000).
Almost surely, 211222210122002 is an apocalyptic number.
11222210122002 is an abundant number, since it is smaller than the sum of its proper divisors (16146054325998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222210122002 is a wasteful number, since it uses less digits than its factorization.
11222210122002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113129588 (or 113129582 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11222210122002 its reverse (20022101222211), we get a palindrome (31244311344213).
The spelling of 11222210122002 in words is "eleven trillion, two hundred twenty-two billion, two hundred ten million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •