Base | Representation |
---|---|
bin | 1010001101001101111111… |
… | …0111000001111001011100 |
3 | 1110201211111010120121211210 |
4 | 2203103133313001321130 |
5 | 2432331041320301022 |
6 | 35511225013544420 |
7 | 2235530555563614 |
oct | 243233767017134 |
9 | 43654433517753 |
10 | 11222210322012 |
11 | 3637349189838 |
12 | 1312b33645110 |
13 | 6353330247b1 |
14 | 2ab22d305a44 |
15 | 146dae954a0c |
hex | a34dfdc1e5c |
11222210322012 has 24 divisors (see below), whose sum is σ = 26892864376336. Its totient is φ = 3639635779968.
The previous prime is 11222210322007. The next prime is 11222210322023. The reversal of 11222210322012 is 21022301222211.
It is a super-2 number, since 2×112222103220122 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11222210322012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12637623793 + ... + 12637624680.
Almost surely, 211222210322012 is an apocalyptic number.
11222210322012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11222210322012 is an abundant number, since it is smaller than the sum of its proper divisors (15670654054324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11222210322012 is a wasteful number, since it uses less digits than its factorization.
11222210322012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25275248517 (or 25275248515 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 11222210322012 its reverse (21022301222211), we get a palindrome (32244511544223).
The spelling of 11222210322012 in words is "eleven trillion, two hundred twenty-two billion, two hundred ten million, three hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •