Base | Representation |
---|---|
bin | 1010000011100001001100… |
… | …01111000001001101010010 |
3 | 2220021210200212212100020111 |
4 | 11001300212033001031102 |
5 | 10344232100034023442 |
6 | 115005414143231534 |
7 | 4441322330260246 |
oct | 501604617011522 |
9 | 86253625770214 |
10 | 22111133111122 |
11 | 7055308229100 |
12 | 25913518a85aa |
13 | c450bca19a53 |
14 | 5662825ac426 |
15 | 285264682b17 |
hex | 141c263c1352 |
22111133111122 has 24 divisors (see below), whose sum is σ = 36688162762188. Its totient is φ = 9986499013920.
The previous prime is 22111133111077. The next prime is 22111133111131.
22111133111122 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 22067906127201 + 43226983921 = 4697649^2 + 207911^2 .
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 22111133111093 and 22111133111102.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 290943913 + ... + 291019900.
Almost surely, 222111133111122 is an apocalyptic number.
22111133111122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22111133111122 is a deficient number, since it is larger than the sum of its proper divisors (14577029651066).
22111133111122 is a wasteful number, since it uses less digits than its factorization.
22111133111122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 581963994 (or 581963983 counting only the distinct ones).
The product of its digits is 144, while the sum is 22.
It can be divided in two parts, 2211113 and 3111122, that added together give a palindrome (5322235).
The spelling of 22111133111122 in words is "twenty-two trillion, one hundred eleven billion, one hundred thirty-three million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •