Base | Representation |
---|---|
bin | 11001100001000010111111… |
… | …100111000100100000011110 |
3 | 112201100022220111201220202110 |
4 | 121201002333213010200132 |
5 | 104202121400232401342 |
6 | 1034402044051334450 |
7 | 32431531516544364 |
oct | 3141027747044036 |
9 | 481308814656673 |
10 | 112222120200222 |
11 | 32837152256a8a |
12 | 10705494bb1426 |
13 | 4a80667870a66 |
14 | 1d9d8185c1634 |
15 | ce924cad7c9c |
hex | 6610bf9c481e |
112222120200222 has 8 divisors (see below), whose sum is σ = 224444240400456. Its totient is φ = 37407373400072.
The previous prime is 112222120200193. The next prime is 112222120200263. The reversal of 112222120200222 is 222002021222211.
It is a sphenic number, since it is the product of 3 distinct primes.
112222120200222 is an admirable number.
It is a super-2 number, since 2×1122221202002222 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9351843350013 + ... + 9351843350024.
It is an arithmetic number, because the mean of its divisors is an integer number (28055530050057).
Almost surely, 2112222120200222 is an apocalyptic number.
112222120200222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112222120200222 is a wasteful number, since it uses less digits than its factorization.
112222120200222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18703686700042.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 112222120200222 its reverse (222002021222211), we get a palindrome (334224141422433).
The spelling of 112222120200222 in words is "one hundred twelve trillion, two hundred twenty-two billion, one hundred twenty million, two hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •