Base | Representation |
---|---|
bin | 100001110001101… |
… | …0110101000011101 |
3 | 2220222120200212111 |
4 | 1003203112220131 |
5 | 4310113404323 |
6 | 304243234021 |
7 | 40041145534 |
oct | 10343265035 |
9 | 2828520774 |
10 | 1133341213 |
11 | 531818034 |
12 | 277678911 |
13 | 150a55704 |
14 | aa73b31b |
15 | 6976ec0d |
hex | 438d6a1d |
1133341213 has 2 divisors, whose sum is σ = 1133341214. Its totient is φ = 1133341212.
The previous prime is 1133341201. The next prime is 1133341217. The reversal of 1133341213 is 3121433311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1132860964 + 480249 = 33658^2 + 693^2 .
It is an emirp because it is prime and its reverse (3121433311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1133341213 - 221 = 1131244061 is a prime.
It is a super-2 number, since 2×11333412132 = 2568924610168622738, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1133341217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566670606 + 566670607.
It is an arithmetic number, because the mean of its divisors is an integer number (566670607).
Almost surely, 21133341213 is an apocalyptic number.
It is an amenable number.
1133341213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133341213 is an equidigital number, since it uses as much as digits as its factorization.
1133341213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 22.
The square root of 1133341213 is about 33665.1334914924. The cubic root of 1133341213 is about 1042.6060177382.
Adding to 1133341213 its reverse (3121433311), we get a palindrome (4254774524).
The spelling of 1133341213 in words is "one billion, one hundred thirty-three million, three hundred forty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •