Base | Representation |
---|---|
bin | 100001011010001… |
… | …1001010000111111 |
3 | 2220010102021202020 |
4 | 1002310121100333 |
5 | 4243440444411 |
6 | 303123331223 |
7 | 36531415425 |
oct | 10264312077 |
9 | 2803367666 |
10 | 1121031231 |
11 | 52587a3a1 |
12 | 273520b13 |
13 | 14b3355b8 |
14 | a8c55115 |
15 | 6863c606 |
hex | 42d1943f |
1121031231 has 8 divisors (see below), whose sum is σ = 1510118064. Its totient is φ = 739649280.
The previous prime is 1121031209. The next prime is 1121031239. The reversal of 1121031231 is 1321301211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1121031231 - 213 = 1121023039 is a prime.
It is a super-2 number, since 2×11210312312 = 2513422041754750722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1121031231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121031239) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1925880 + ... + 1926461.
It is an arithmetic number, because the mean of its divisors is an integer number (188764758).
Almost surely, 21121031231 is an apocalyptic number.
1121031231 is a deficient number, since it is larger than the sum of its proper divisors (389086833).
1121031231 is an equidigital number, since it uses as much as digits as its factorization.
1121031231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3852441.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1121031231 is about 33481.8044764615. The cubic root of 1121031231 is about 1038.8174524122.
Adding to 1121031231 its reverse (1321301211), we get a palindrome (2442332442).
The spelling of 1121031231 in words is "one billion, one hundred twenty-one million, thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •