Base | Representation |
---|---|
bin | 1010001100100001010100… |
… | …1100000000100101011110 |
3 | 1110200200112111212212010201 |
4 | 2203020111030000211132 |
5 | 2432132012322042342 |
6 | 35501523134054114 |
7 | 2234624463514015 |
oct | 243102514004536 |
9 | 43620474785121 |
10 | 11210220112222 |
11 | 363225600474a |
12 | 131074804a33a |
13 | 634171c0a1c1 |
14 | 2aa812b15a7c |
15 | 14690beb9db7 |
hex | a321530095e |
11210220112222 has 4 divisors (see below), whose sum is σ = 16815330168336. Its totient is φ = 5605110056110.
The previous prime is 11210220112213. The next prime is 11210220112291. The reversal of 11210220112222 is 22221102201211.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×112102201122223 (a number of 40 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11210220112222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2802555028054 + ... + 2802555028057.
It is an arithmetic number, because the mean of its divisors is an integer number (4203832542084).
Almost surely, 211210220112222 is an apocalyptic number.
11210220112222 is a deficient number, since it is larger than the sum of its proper divisors (5605110056114).
11210220112222 is an equidigital number, since it uses as much as digits as its factorization.
11210220112222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5605110056113.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11210220112222 its reverse (22221102201211), we get a palindrome (33431322313433).
The spelling of 11210220112222 in words is "eleven trillion, two hundred ten billion, two hundred twenty million, one hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •