Base | Representation |
---|---|
bin | 100010000000101… |
… | …1010101101001111 |
3 | 2221112102002120202 |
4 | 1010001122231033 |
5 | 4314123102343 |
6 | 305124204115 |
7 | 40165141331 |
oct | 10401325517 |
9 | 2845362522 |
10 | 1141222223 |
11 | 536210169 |
12 | 27a23963b |
13 | 15258492b |
14 | ab7cd451 |
15 | 6a2c9db8 |
hex | 4405ab4f |
1141222223 has 4 divisors (see below), whose sum is σ = 1208352960. Its totient is φ = 1074091488.
The previous prime is 1141222219. The next prime is 1141222273. The reversal of 1141222223 is 3222221411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3222221411 = 139 ⋅23181449.
It is a cyclic number.
It is not a de Polignac number, because 1141222223 - 22 = 1141222219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1141222195 and 1141222204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141222273) 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, 33565343 + ... + 33565376.
It is an arithmetic number, because the mean of its divisors is an integer number (302088240).
Almost surely, 21141222223 is an apocalyptic number.
1141222223 is a deficient number, since it is larger than the sum of its proper divisors (67130737).
1141222223 is an equidigital number, since it uses as much as digits as its factorization.
1141222223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67130736.
The product of its digits is 384, while the sum is 20.
The square root of 1141222223 is about 33781.9807441778. The cubic root of 1141222223 is about 1045.0171232590.
Adding to 1141222223 its reverse (3222221411), we get a palindrome (4363443634).
The spelling of 1141222223 in words is "one billion, one hundred forty-one million, two hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •