Base | Representation |
---|---|
bin | 100001011010010… |
… | …1111001101101011 |
3 | 2220010120212001212 |
4 | 1002310233031223 |
5 | 4244001334011 |
6 | 303125303335 |
7 | 36532241504 |
oct | 10264571553 |
9 | 2803525055 |
10 | 1121121131 |
11 | 525930999 |
12 | 273564b4b |
13 | 14b3674b0 |
14 | a8c79bab |
15 | 6865908b |
hex | 42d2f36b |
1121121131 has 8 divisors (see below), whose sum is σ = 1259855520. Its totient is φ = 989885952.
The previous prime is 1121121103. The next prime is 1121121263. The reversal of 1121121131 is 1311211211.
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 1121121131 - 210 = 1121120107 is a prime.
It is a super-2 number, since 2×11211211312 = 2513825180749438322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120121131) 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, 1874486 + ... + 1875083.
It is an arithmetic number, because the mean of its divisors is an integer number (157481940).
Almost surely, 21121121131 is an apocalyptic number.
1121121131 is a deficient number, since it is larger than the sum of its proper divisors (138734389).
1121121131 is a wasteful number, since it uses less digits than its factorization.
1121121131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3749605.
The product of its digits is 12, while the sum is 14.
The square root of 1121121131 is about 33483.1469697817. The cubic root of 1121121131 is about 1038.8452206521.
Adding to 1121121131 its reverse (1311211211), we get a palindrome (2432332342).
The spelling of 1121121131 in words is "one billion, one hundred twenty-one million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •