Base | Representation |
---|---|
bin | 100001101111101… |
… | …1101110110110100 |
3 | 2220220122221002022 |
4 | 1003133131312310 |
5 | 4304333302403 |
6 | 304205332312 |
7 | 40026402662 |
oct | 10337356664 |
9 | 2826587068 |
10 | 1132322228 |
11 | 5311914a4 |
12 | 277267098 |
13 | 15078996b |
14 | aa553c32 |
15 | 6961cd38 |
hex | 437dddb4 |
1132322228 has 6 divisors (see below), whose sum is σ = 1981563906. Its totient is φ = 566161112.
The previous prime is 1132322227. The next prime is 1132322237. The reversal of 1132322228 is 8222232311.
It can be written as a sum of positive squares in only one way, i.e., 1125468304 + 6853924 = 33548^2 + 2618^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1132322197 and 1132322206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132322227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 141540275 + ... + 141540282.
It is an arithmetic number, because the mean of its divisors is an integer number (330260651).
Almost surely, 21132322228 is an apocalyptic number.
It is an amenable number.
1132322228 is a deficient number, since it is larger than the sum of its proper divisors (849241678).
1132322228 is a wasteful number, since it uses less digits than its factorization.
1132322228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283080561 (or 283080559 counting only the distinct ones).
The product of its digits is 2304, while the sum is 26.
The square root of 1132322228 is about 33649.9959583950. The cubic root of 1132322228 is about 1042.2934556605.
Adding to 1132322228 its reverse (8222232311), we get a palindrome (9354554539).
The spelling of 1132322228 in words is "one billion, one hundred thirty-two million, three hundred twenty-two thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •