Base | Representation |
---|---|
bin | 1010000000101000111101… |
… | …01011111010101011011110 |
3 | 2212221100101121120111220111 |
4 | 11000110132223322223132 |
5 | 10341122012342033042 |
6 | 114452135243440234 |
7 | 4431221246500255 |
oct | 500243653725336 |
9 | 85840347514814 |
10 | 22012222221022 |
11 | 701737064a430 |
12 | 257614882607a |
13 | c38988a47247 |
14 | 56157c05379c |
15 | 2828c5d7c517 |
hex | 14051eafaade |
22012222221022 has 16 divisors (see below), whose sum is σ = 36063449967600. Its totient is φ = 9993486119040.
The previous prime is 22012222221013. The next prime is 22012222221049.
22012222221022 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 = 22012222220984 and 22012222221002.
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, 603453147 + ... + 603489622.
It is an arithmetic number, because the mean of its divisors is an integer number (2253965622975).
Almost surely, 222012222221022 is an apocalyptic number.
22012222221022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22012222221022 is a deficient number, since it is larger than the sum of its proper divisors (14051227746578).
22012222221022 is a wasteful number, since it uses less digits than its factorization.
22012222221022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1206943611.
The product of its (nonzero) digits is 1024, while the sum is 22.
Multiplying 22012222221022 by its sum of digits (22), we get a palindrome (484268888862484).
It can be divided in two parts, 2201222 and 2221022, that added together give a palindrome (4422244).
The spelling of 22012222221022 in words is "twenty-two trillion, twelve billion, two hundred twenty-two million, two hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •