Base | Representation |
---|---|
bin | 100000010100101011000… |
… | …010101010110111111110 |
3 | 21212100100122201000012111 |
4 | 200110223002222313332 |
5 | 242343024333242342 |
6 | 4420225305524234 |
7 | 316322623166014 |
oct | 40245302526776 |
9 | 7770318630174 |
10 | 2221220212222 |
11 | 7870179a2560 |
12 | 2ba5a21a367a |
13 | 1315c9cab52b |
14 | 79716d288b4 |
15 | 3cba439c217 |
hex | 2052b0aadfe |
2221220212222 has 16 divisors (see below), whose sum is σ = 3694309624944. Its totient is φ = 993093984000.
The previous prime is 2221220212207. The next prime is 2221220212231. The reversal of 2221220212222 is 2222120221222.
2221220212222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 = 2221220212193 and 2221220212202.
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, 827576979 + ... + 827579662.
It is an arithmetic number, because the mean of its divisors is an integer number (230894351559).
Almost surely, 22221220212222 is an apocalyptic number.
2221220212222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2221220212222 is a deficient number, since it is larger than the sum of its proper divisors (1473089412722).
2221220212222 is a wasteful number, since it uses less digits than its factorization.
2221220212222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1655156715.
The product of its (nonzero) digits is 1024, while the sum is 22.
Adding to 2221220212222 its reverse (2222120221222), we get a palindrome (4443340433444).
The spelling of 2221220212222 in words is "two trillion, two hundred twenty-one billion, two hundred twenty million, two hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •