Base | Representation |
---|---|
bin | 1010000110101111101110… |
… | …00100101011101110001110 |
3 | 2220200101220011012211020111 |
4 | 11003113313010223232032 |
5 | 10403041134310202342 |
6 | 115132352333510234 |
7 | 4452326102050264 |
oct | 503276704535616 |
9 | 86611804184214 |
10 | 22222011022222 |
11 | 7098335993880 |
12 | 25aa93664237a |
13 | c526b007817b |
14 | 56b7a01dc434 |
15 | 2880a3892217 |
hex | 1435f712bb8e |
22222011022222 has 16 divisors (see below), whose sum is σ = 36364198413312. Its totient is φ = 10100661976120.
The previous prime is 22222011022163. The next prime is 22222011022307.
22222011022222 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 22222011022193 and 22222011022202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11703388 + ... + 13468975.
It is an arithmetic number, because the mean of its divisors is an integer number (2272762400832).
Almost surely, 222222011022222 is an apocalyptic number.
22222011022222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22222011022222 is a deficient number, since it is larger than the sum of its proper divisors (14142187391090).
22222011022222 is a wasteful number, since it uses less digits than its factorization.
22222011022222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25212503.
The product of its (nonzero) digits is 1024, while the sum is 22.
Multiplying 22222011022222 by its sum of digits (22), we get a palindrome (488884242488884).
It can be divided in two parts, 2222201 and 1022222, that added together give a palindrome (3244423).
The spelling of 22222011022222 in words is "twenty-two trillion, two hundred twenty-two billion, eleven million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •