Base | Representation |
---|---|
bin | 1010000001111100110001… |
… | …11000110111111110010011 |
3 | 2220002122112201210210012211 |
4 | 11000332120320313332103 |
5 | 10342341142330023443 |
6 | 114524540431332551 |
7 | 4434403345320163 |
oct | 500763070677623 |
9 | 86078481723184 |
10 | 22057222111123 |
11 | 703446293a951 |
12 | 2582a07081157 |
13 | c3ccaa91a354 |
14 | 56380a6945a3 |
15 | 283b5b79819d |
hex | 140f98e37f93 |
22057222111123 has 8 divisors (see below), whose sum is σ = 22530422983680. Its totient is φ = 21584183666760.
The previous prime is 22057222111051. The next prime is 22057222111139. The reversal of 22057222111123 is 32111122275022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22057222111123 is a prime.
It is a super-2 number, since 2×220572221111232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22057222111153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40332523 + ... + 40875748.
It is an arithmetic number, because the mean of its divisors is an integer number (2816302872960).
Almost surely, 222057222111123 is an apocalyptic number.
22057222111123 is a deficient number, since it is larger than the sum of its proper divisors (473200872557).
22057222111123 is an equidigital number, since it uses as much as digits as its factorization.
22057222111123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81214097.
The product of its (nonzero) digits is 6720, while the sum is 31.
Adding to 22057222111123 its reverse (32111122275022), we get a palindrome (54168344386145).
The spelling of 22057222111123 in words is "twenty-two trillion, fifty-seven billion, two hundred twenty-two million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •