Base | Representation |
---|---|
bin | 100001110010001… |
… | …1010000000110001 |
3 | 2221000002201110021 |
4 | 1003210122000301 |
5 | 4310201222301 |
6 | 304253203441 |
7 | 40043405263 |
oct | 10344320061 |
9 | 2830081407 |
10 | 1133617201 |
11 | 531996422 |
12 | 277790581 |
13 | 150b21212 |
14 | aa7adb33 |
15 | 697c68a1 |
hex | 4391a031 |
1133617201 has 2 divisors, whose sum is σ = 1133617202. Its totient is φ = 1133617200.
The previous prime is 1133617189. The next prime is 1133617253. The reversal of 1133617201 is 1027163311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 680949025 + 452668176 = 26095^2 + 21276^2 .
It is an emirp because it is prime and its reverse (1027163311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1133617201 - 29 = 1133616689 is a prime.
It is a super-3 number, since 3×11336172013 (a number of 28 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1133617271) 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 as a sum of consecutive naturals, namely, 566808600 + 566808601.
It is an arithmetic number, because the mean of its divisors is an integer number (566808601).
Almost surely, 21133617201 is an apocalyptic number.
It is an amenable number.
1133617201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133617201 is an equidigital number, since it uses as much as digits as its factorization.
1133617201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 25.
The square root of 1133617201 is about 33669.2322603293. The cubic root of 1133617201 is about 1042.6906416780.
The spelling of 1133617201 in words is "one billion, one hundred thirty-three million, six hundred seventeen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •