Base | Representation |
---|---|
bin | 100001101111100… |
… | …0100111011100011 |
3 | 2220220110202000221 |
4 | 1003133010323203 |
5 | 4304322021011 |
6 | 304203223511 |
7 | 40025466220 |
oct | 10337047343 |
9 | 2826422027 |
10 | 1132220131 |
11 | 531121819 |
12 | 277217b97 |
13 | 150752353 |
14 | aa528947 |
15 | 695ec971 |
hex | 437c4ee3 |
1132220131 has 4 divisors (see below), whose sum is σ = 1293965872. Its totient is φ = 970474392.
The previous prime is 1132220123. The next prime is 1132220147. The reversal of 1132220131 is 1310222311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1132220131 - 23 = 1132220123 is a prime.
It is a super-2 number, since 2×11322201312 = 2563844850083314322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1132220231) 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 3 ways as a sum of consecutive naturals, for example, 80872860 + ... + 80872873.
It is an arithmetic number, because the mean of its divisors is an integer number (323491468).
Almost surely, 21132220131 is an apocalyptic number.
1132220131 is a deficient number, since it is larger than the sum of its proper divisors (161745741).
1132220131 is an equidigital number, since it uses as much as digits as its factorization.
1132220131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161745740.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1132220131 is about 33648.4788809242. The cubic root of 1132220131 is about 1042.2621282313.
Adding to 1132220131 its reverse (1310222311), we get a palindrome (2442442442).
The spelling of 1132220131 in words is "one billion, one hundred thirty-two million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •