Base | Representation |
---|---|
bin | 100011110101000… |
… | …1111100011110001 |
3 | 10002210020221100012 |
4 | 1013222033203301 |
5 | 4430234143423 |
6 | 315144304305 |
7 | 41536002602 |
oct | 10752174361 |
9 | 3083227305 |
10 | 1202256113 |
11 | 5677078a3 |
12 | 296772095 |
13 | 162104366 |
14 | b5959da9 |
15 | 70834078 |
hex | 47a8f8f1 |
1202256113 has 2 divisors, whose sum is σ = 1202256114. Its totient is φ = 1202256112.
The previous prime is 1202256091. The next prime is 1202256149. The reversal of 1202256113 is 3116522021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1199098384 + 3157729 = 34628^2 + 1777^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1202256113 is a prime.
It is a super-2 number, since 2×12022561132 = 2890839522491737538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1202256313) 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, 601128056 + 601128057.
It is an arithmetic number, because the mean of its divisors is an integer number (601128057).
Almost surely, 21202256113 is an apocalyptic number.
It is an amenable number.
1202256113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1202256113 is an equidigital number, since it uses as much as digits as its factorization.
1202256113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 1202256113 is about 34673.5650460116. The cubic root of 1202256113 is about 1063.3241183174.
Adding to 1202256113 its reverse (3116522021), we get a palindrome (4318778134).
The spelling of 1202256113 in words is "one billion, two hundred two million, two hundred fifty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •