Base | Representation |
---|---|
bin | 10000001011110100010… |
… | …110001100101100001110 |
3 | 10221022210012102220201200 |
4 | 100023310112030230032 |
5 | 121210241430202342 |
6 | 2210534343450330 |
7 | 143232243463623 |
oct | 20136426145416 |
9 | 3838705386650 |
10 | 1112201022222 |
11 | 399755533634 |
12 | 15b675a569a6 |
13 | 80b59794454 |
14 | 3bb8ba9234a |
15 | 1dde6bcd94c |
hex | 102f458cb0e |
1112201022222 has 24 divisors (see below), whose sum is σ = 2412740268120. Its totient is φ = 370276537680.
The previous prime is 1112201022203. The next prime is 1112201022253. The reversal of 1112201022222 is 2222201022111.
It is a happy number.
It is a super-2 number, since 2×11122010222222 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1112201022195 and 1112201022204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 38079697 + ... + 38108892.
It is an arithmetic number, because the mean of its divisors is an integer number (100530844505).
Almost surely, 21112201022222 is an apocalyptic number.
1112201022222 is an abundant number, since it is smaller than the sum of its proper divisors (1300539245898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112201022222 is a wasteful number, since it uses less digits than its factorization.
1112201022222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76189408 (or 76189405 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1112201022222 its reverse (2222201022111), we get a palindrome (3334402044333).
The spelling of 1112201022222 in words is "one trillion, one hundred twelve billion, two hundred one million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •