Base | Representation |
---|---|
bin | 100001011101110… |
… | …1001100110001011 |
3 | 2220020222220122222 |
4 | 1002323221212023 |
5 | 4244432330011 |
6 | 303232204255 |
7 | 36553526345 |
oct | 10273514613 |
9 | 2806886588 |
10 | 1122933131 |
11 | 526959311 |
12 | 27409968b |
13 | 14b850198 |
14 | a91cc295 |
15 | 688b5ddb |
hex | 42ee998b |
1122933131 has 4 divisors (see below), whose sum is σ = 1123239600. Its totient is φ = 1122626664.
The previous prime is 1122933127. The next prime is 1122933137. The reversal of 1122933131 is 1313392211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1313392211 = 577 ⋅2276243.
It is a cyclic number.
It is not a de Polignac number, because 1122933131 - 22 = 1122933127 is a prime.
It is a super-2 number, since 2×11229331312 = 2521957633394926322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1122933131.
It is not an unprimeable number, because it can be changed into a prime (1122933137) 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, 147671 + ... + 155088.
It is an arithmetic number, because the mean of its divisors is an integer number (280809900).
Almost surely, 21122933131 is an apocalyptic number.
1122933131 is a deficient number, since it is larger than the sum of its proper divisors (306469).
1122933131 is an equidigital number, since it uses as much as digits as its factorization.
1122933131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306468.
The product of its digits is 972, while the sum is 26.
The square root of 1122933131 is about 33510.1944339331. The cubic root of 1122933131 is about 1039.4045935477.
The spelling of 1122933131 in words is "one billion, one hundred twenty-two million, nine hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •