Base | Representation |
---|---|
bin | 1010001100100001010000… |
… | …0011110111101001000110 |
3 | 1110200200111012022002010022 |
4 | 2203020110003313221012 |
5 | 2432131443001414342 |
6 | 35501521220455142 |
7 | 2234624144001632 |
oct | 243102403675106 |
9 | 43620435262108 |
10 | 11210201201222 |
11 | 3632246368621 |
12 | 131074184a4b2 |
13 | 63416b01866a |
14 | 2aa8103d1dc2 |
15 | 14690a4d19d2 |
hex | a32140f7a46 |
11210201201222 has 8 divisors (see below), whose sum is σ = 17700317686200. Its totient is φ = 5310095305824.
The previous prime is 11210201201189. The next prime is 11210201201261. The reversal of 11210201201222 is 22210210201211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×112102012012222 (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 11210201201222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 147502647347 + ... + 147502647422.
It is an arithmetic number, because the mean of its divisors is an integer number (2212539710775).
Almost surely, 211210201201222 is an apocalyptic number.
11210201201222 is a deficient number, since it is larger than the sum of its proper divisors (6490116484978).
11210201201222 is a wasteful number, since it uses less digits than its factorization.
11210201201222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295005294790.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11210201201222 its reverse (22210210201211), we get a palindrome (33420411402433).
The spelling of 11210201201222 in words is "eleven trillion, two hundred ten billion, two hundred one million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •