Base | Representation |
---|---|
bin | 100001110001111… |
… | …1101011100111101 |
3 | 2220222212202222200 |
4 | 1003203331130331 |
5 | 4310134001341 |
6 | 304250502113 |
7 | 40042410240 |
oct | 10343753475 |
9 | 2828782880 |
10 | 1133500221 |
11 | 531916547 |
12 | 277734939 |
13 | 150aacbb9 |
14 | aa77d257 |
15 | 697a1db6 |
hex | 438fd73d |
1133500221 has 12 divisors (see below), whose sum is σ = 1871175072. Its totient is φ = 647714376.
The previous prime is 1133500133. The next prime is 1133500223. The reversal of 1133500221 is 1220053311.
It is not a de Polignac number, because 1133500221 - 225 = 1099945789 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1133500194 and 1133500203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133500223) 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 in 11 ways as a sum of consecutive naturals, for example, 8995971 + ... + 8996096.
It is an arithmetic number, because the mean of its divisors is an integer number (155931256).
Almost surely, 21133500221 is an apocalyptic number.
It is an amenable number.
1133500221 is a deficient number, since it is larger than the sum of its proper divisors (737674851).
1133500221 is a wasteful number, since it uses less digits than its factorization.
1133500221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17992080 (or 17992077 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 1133500221 is about 33667.4950211625. The cubic root of 1133500221 is about 1042.6547747360.
Adding to 1133500221 its reverse (1220053311), we get a palindrome (2353553532).
The spelling of 1133500221 in words is "one billion, one hundred thirty-three million, five hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •