Base | Representation |
---|---|
bin | 100000010100101011000… |
… | …010010000000001001110 |
3 | 21212100100122111102022102 |
4 | 200110223002100001032 |
5 | 242343024321232342 |
6 | 4420225303315102 |
7 | 316322622230222 |
oct | 40245302200116 |
9 | 7770318442272 |
10 | 2221220102222 |
11 | 787017927950 |
12 | 2ba5a214ba92 |
13 | 1315c9c70444 |
14 | 79716cda782 |
15 | 3cba4379832 |
hex | 2052b09004e |
2221220102222 has 16 divisors (see below), whose sum is σ = 3751972959744. Its totient is φ = 977076291000.
The previous prime is 2221220102207. The next prime is 2221220102261. The reversal of 2221220102222 is 2222010221222.
It is a super-2 number, since 2×22212201022222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2221220102194 and 2221220102203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1628459804 + ... + 1628461167.
It is an arithmetic number, because the mean of its divisors is an integer number (234498309984).
Almost surely, 22221220102222 is an apocalyptic number.
2221220102222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2221220102222 is a deficient number, since it is larger than the sum of its proper divisors (1530752857522).
2221220102222 is a wasteful number, since it uses less digits than its factorization.
2221220102222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3256921015.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 2221220102222 its reverse (2222010221222), we get a palindrome (4443230323444).
The spelling of 2221220102222 in words is "two trillion, two hundred twenty-one billion, two hundred twenty million, one hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •