Base | Representation |
---|---|
bin | 100001110001110… |
… | …0111101100101101 |
3 | 2220222201020202112 |
4 | 1003203213230231 |
5 | 4310123123432 |
6 | 304244533405 |
7 | 40041556406 |
oct | 10343475455 |
9 | 2828636675 |
10 | 1133411117 |
11 | 531865603 |
12 | 2776b1265 |
13 | 150a7b487 |
14 | aa7589ad |
15 | 697857b2 |
hex | 438e7b2d |
1133411117 has 2 divisors, whose sum is σ = 1133411118. Its totient is φ = 1133411116.
The previous prime is 1133411113. The next prime is 1133411137. The reversal of 1133411117 is 7111143311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 968827876 + 164583241 = 31126^2 + 12829^2 .
It is a cyclic number.
It is not a de Polignac number, because 1133411117 - 22 = 1133411113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1133411092 and 1133411101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1133411113) 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 as a sum of consecutive naturals, namely, 566705558 + 566705559.
It is an arithmetic number, because the mean of its divisors is an integer number (566705559).
Almost surely, 21133411117 is an apocalyptic number.
It is an amenable number.
1133411117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133411117 is an equidigital number, since it uses as much as digits as its factorization.
1133411117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 252, while the sum is 23.
The square root of 1133411117 is about 33666.1717009820. The cubic root of 1133411117 is about 1042.6274531282.
Adding to 1133411117 its reverse (7111143311), we get a palindrome (8244554428).
The spelling of 1133411117 in words is "one billion, one hundred thirty-three million, four hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •