Base | Representation |
---|---|
bin | 1010000001001100001001… |
… | …00100000111001001001111 |
3 | 2220000011011000202011122020 |
4 | 11000212010210013021033 |
5 | 10341424203444221033 |
6 | 114504541450421223 |
7 | 4432460322260142 |
oct | 500460444071117 |
9 | 86004130664566 |
10 | 22031111320143 |
11 | 7024383a99152 |
12 | 257993a731813 |
13 | c3a6a9225583 |
14 | 5624509a0059 |
15 | 28312e30c6b3 |
hex | 14098490724f |
22031111320143 has 4 divisors (see below), whose sum is σ = 29374815093528. Its totient is φ = 14687407546760.
The previous prime is 22031111320133. The next prime is 22031111320301. The reversal of 22031111320143 is 34102311113022.
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 22031111320143 - 25 = 22031111320111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22031111320133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3671851886688 + ... + 3671851886693.
It is an arithmetic number, because the mean of its divisors is an integer number (7343703773382).
Almost surely, 222031111320143 is an apocalyptic number.
22031111320143 is a deficient number, since it is larger than the sum of its proper divisors (7343703773385).
22031111320143 is an equidigital number, since it uses as much as digits as its factorization.
22031111320143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7343703773384.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 22031111320143 its reverse (34102311113022), we get a palindrome (56133422433165).
The spelling of 22031111320143 in words is "twenty-two trillion, thirty-one billion, one hundred eleven million, three hundred twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •