Base | Representation |
---|---|
bin | 1100111011110000111… |
… | …0010110100011110010 |
3 | 210020112120210001202000 |
4 | 3032330032112203302 |
5 | 12120032002223442 |
6 | 250024451034430 |
7 | 22024232063022 |
oct | 3167416264362 |
9 | 706476701660 |
10 | 222201211122 |
11 | 86264877770 |
12 | 3709289ba16 |
13 | 17c51a607a7 |
14 | aa7c87ba82 |
15 | 5ba759ad4c |
hex | 33bc3968f2 |
222201211122 has 32 divisors (see below), whose sum is σ = 538669604160. Its totient is φ = 67333700160.
The previous prime is 222201211103. The next prime is 222201211123. The reversal of 222201211122 is 221112102222.
It is a happy number.
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 = 222201211095 and 222201211104.
It is not an unprimeable number, because it can be changed into a prime (222201211123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 187037463 + ... + 187038650.
It is an arithmetic number, because the mean of its divisors is an integer number (16833425130).
Almost surely, 2222201211122 is an apocalyptic number.
222201211122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
222201211122 is an abundant number, since it is smaller than the sum of its proper divisors (316468393038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222201211122 is a wasteful number, since it uses less digits than its factorization.
222201211122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374076135 (or 374076129 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 222201211122 its reverse (221112102222), we get a palindrome (443313313344).
The spelling of 222201211122 in words is "two hundred twenty-two billion, two hundred one million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •