Base | Representation |
---|---|
bin | 1010000001011101010011… |
… | …00100100111010001001111 |
3 | 2220001000220221112110200001 |
4 | 11000232221210213101033 |
5 | 10342102034432041221 |
6 | 114513103442345131 |
7 | 4433234505054043 |
oct | 500565144472117 |
9 | 86030827473601 |
10 | 22040322143311 |
11 | 70282802949aa |
12 | 257b68b35b1a7 |
13 | c3b51657c2b4 |
14 | 562a85db4023 |
15 | 2834bcc80391 |
hex | 140ba992744f |
22040322143311 has 4 divisors (see below), whose sum is σ = 22350749215824. Its totient is φ = 21729895070800.
The previous prime is 22040322143299. The next prime is 22040322143387. The reversal of 22040322143311 is 11334122304022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22040322143311 - 29 = 22040322142799 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22040322143311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22040322143911) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 155213536150 + ... + 155213536291.
It is an arithmetic number, because the mean of its divisors is an integer number (5587687303956).
Almost surely, 222040322143311 is an apocalyptic number.
22040322143311 is a deficient number, since it is larger than the sum of its proper divisors (310427072513).
22040322143311 is an equidigital number, since it uses as much as digits as its factorization.
22040322143311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310427072512.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 22040322143311 its reverse (11334122304022), we get a palindrome (33374444447333).
The spelling of 22040322143311 in words is "twenty-two trillion, forty billion, three hundred twenty-two million, one hundred forty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •