Base | Representation |
---|---|
bin | 1010000100011010111100… |
… | …11101100010001011001111 |
3 | 2220101202201220002001010211 |
4 | 11002031132131202023033 |
5 | 10400234101122230333 |
6 | 115031543110343251 |
7 | 4443500620624636 |
oct | 502153635421317 |
9 | 86352656061124 |
10 | 22142141211343 |
11 | 706747a51880a |
12 | 259736635ab27 |
13 | c47cc1bc6c4a |
14 | 56798487251d |
15 | 285e7ba3cecd |
hex | 14235e7622cf |
22142141211343 has 4 divisors (see below), whose sum is σ = 22142618963488. Its totient is φ = 22141663459200.
The previous prime is 22142141211301. The next prime is 22142141211371. The reversal of 22142141211343 is 34311214124122.
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 22142141211343 - 217 = 22142141080271 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22142141211943) 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 3 ways as a sum of consecutive naturals, for example, 238806546 + ... + 238899247.
It is an arithmetic number, because the mean of its divisors is an integer number (5535654740872).
Almost surely, 222142141211343 is an apocalyptic number.
22142141211343 is a deficient number, since it is larger than the sum of its proper divisors (477752145).
22142141211343 is an equidigital number, since it uses as much as digits as its factorization.
22142141211343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477752144.
The product of its digits is 9216, while the sum is 31.
Adding to 22142141211343 its reverse (34311214124122), we get a palindrome (56453355335465).
The spelling of 22142141211343 in words is "twenty-two trillion, one hundred forty-two billion, one hundred forty-one million, two hundred eleven thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •