Base | Representation |
---|---|
bin | 100001110001000… |
… | …0110000100010101 |
3 | 2220221221221012120 |
4 | 1003202012010111 |
5 | 4310022324341 |
6 | 304232210153 |
7 | 40035302466 |
oct | 10342060425 |
9 | 2827857176 |
10 | 1133011221 |
11 | 531612111 |
12 | 277539959 |
13 | 15096b454 |
14 | aa692d6d |
15 | 69707066 |
hex | 43886115 |
1133011221 has 8 divisors (see below), whose sum is σ = 1511183040. Its totient is φ = 755090112.
The previous prime is 1133011213. The next prime is 1133011259. The reversal of 1133011221 is 1221103311.
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 1133011221 - 23 = 1133011213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1133011221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133011421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51865 + ... + 70398.
It is an arithmetic number, because the mean of its divisors is an integer number (188897880).
Almost surely, 21133011221 is an apocalyptic number.
It is an amenable number.
1133011221 is a deficient number, since it is larger than the sum of its proper divisors (378171819).
1133011221 is a wasteful number, since it uses less digits than its factorization.
1133011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125355.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1133011221 is about 33660.2320401984. The cubic root of 1133011221 is about 1042.5048169587.
Adding to 1133011221 its reverse (1221103311), we get a palindrome (2354114532).
The spelling of 1133011221 in words is "one billion, one hundred thirty-three million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •