Base | Representation |
---|---|
bin | 10001110010011110000… |
… | …110000110010111100101 |
3 | 11022212021202202011211021 |
4 | 101302132012012113211 |
5 | 130012010304024031 |
6 | 2333323505411141 |
7 | 154213533000631 |
oct | 21623606062745 |
9 | 4285252664737 |
10 | 1222423111141 |
11 | 431476a83401 |
12 | 178ab7039ab1 |
13 | 8b373cb07cb |
14 | 43246567dc1 |
15 | 21be8545511 |
hex | 11c9e1865e5 |
1222423111141 has 4 divisors (see below), whose sum is σ = 1222448461612. Its totient is φ = 1222397760672.
The previous prime is 1222423111121. The next prime is 1222423111163. The reversal of 1222423111141 is 1411113242221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 487895265025 + 734527846116 = 698495^2 + 857046^2 .
It is a cyclic number.
It is not a de Polignac number, because 1222423111141 - 217 = 1222422980069 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 (1222423111121) 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, 12602766 + ... + 12699391.
It is an arithmetic number, because the mean of its divisors is an integer number (305612115403).
Almost surely, 21222423111141 is an apocalyptic number.
It is an amenable number.
1222423111141 is a deficient number, since it is larger than the sum of its proper divisors (25350471).
1222423111141 is an equidigital number, since it uses as much as digits as its factorization.
1222423111141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25350470.
The product of its digits is 768, while the sum is 25.
Adding to 1222423111141 its reverse (1411113242221), we get a palindrome (2633536353362).
The spelling of 1222423111141 in words is "one trillion, two hundred twenty-two billion, four hundred twenty-three million, one hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •