Base | Representation |
---|---|
bin | 1010000011110111111010… |
… | …10010101100100011001001 |
3 | 2220022222011222112221111221 |
4 | 11001323331102230203021 |
5 | 10344432040231023423 |
6 | 115015152404522041 |
7 | 4442233524461401 |
oct | 501737522544311 |
9 | 86288158487457 |
10 | 22123331111113 |
11 | 705a4a7727031 |
12 | 25937969b0321 |
13 | c462b4bb841b |
14 | 566abc60b801 |
15 | 28572a4b4e5d |
hex | 141efd4ac8c9 |
22123331111113 has 8 divisors (see below), whose sum is σ = 22260684546432. Its totient is φ = 21986327622096.
The previous prime is 22123331111111. The next prime is 22123331111159. The reversal of 22123331111113 is 31111113332122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22123331111113 - 21 = 22123331111111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22123331111111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87359745 + ... + 87612622.
It is an arithmetic number, because the mean of its divisors is an integer number (2782585568304).
Almost surely, 222123331111113 is an apocalyptic number.
It is an amenable number.
22123331111113 is a deficient number, since it is larger than the sum of its proper divisors (137353435319).
22123331111113 is a wasteful number, since it uses less digits than its factorization.
22123331111113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174973151.
The product of its digits is 648, while the sum is 25.
Adding to 22123331111113 its reverse (31111113332122), we get a palindrome (53234444443235).
The spelling of 22123331111113 in words is "twenty-two trillion, one hundred twenty-three billion, three hundred thirty-one million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •