Base | Representation |
---|---|
bin | 100001101101011… |
… | …1000011001011111 |
3 | 2220211101212020121 |
4 | 1003122320121133 |
5 | 4304031321343 |
6 | 304123455411 |
7 | 40013235412 |
oct | 10332703137 |
9 | 2824355217 |
10 | 1131120223 |
11 | 530540402 |
12 | 276987567 |
13 | 15045880c |
14 | aa31db79 |
15 | 69481aed |
hex | 436b865f |
1131120223 has 8 divisors (see below), whose sum is σ = 1158839136. Its totient is φ = 1103637600.
The previous prime is 1131120187. The next prime is 1131120253. The reversal of 1131120223 is 3220211311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1131120223 - 229 = 594249311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1131120197 and 1131120206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131120253) 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 7 ways as a sum of consecutive naturals, for example, 49363 + ... + 68548.
It is an arithmetic number, because the mean of its divisors is an integer number (144854892).
Almost surely, 21131120223 is an apocalyptic number.
1131120223 is a deficient number, since it is larger than the sum of its proper divisors (27718913).
1131120223 is a wasteful number, since it uses less digits than its factorization.
1131120223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118145.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1131120223 is about 33632.1308126619. The cubic root of 1131120223 is about 1041.9245131194.
Adding to 1131120223 its reverse (3220211311), we get a palindrome (4351331534).
The spelling of 1131120223 in words is "one billion, one hundred thirty-one million, one hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •