Base | Representation |
---|---|
bin | 100011110110101… |
… | …1110100101110001 |
3 | 10002211212000120121 |
4 | 1013231132211301 |
5 | 4430443312423 |
6 | 315214410241 |
7 | 41546134111 |
oct | 10755364561 |
9 | 3084760517 |
10 | 1203104113 |
11 | 568136a22 |
12 | 296b00981 |
13 | 162340333 |
14 | b5adb041 |
15 | 7095045d |
hex | 47b5e971 |
1203104113 has 2 divisors, whose sum is σ = 1203104114. Its totient is φ = 1203104112.
The previous prime is 1203104101. The next prime is 1203104129. The reversal of 1203104113 is 3114013021.
It is an a-pointer prime, because the next prime (1203104129) can be obtained adding 1203104113 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 677456784 + 525647329 = 26028^2 + 22927^2 .
It is a cyclic number.
It is not a de Polignac number, because 1203104113 - 213 = 1203095921 is a prime.
It is a super-3 number, since 3×12031041133 (a number of 28 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1203104183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 601552056 + 601552057.
It is an arithmetic number, because the mean of its divisors is an integer number (601552057).
Almost surely, 21203104113 is an apocalyptic number.
It is an amenable number.
1203104113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1203104113 is an equidigital number, since it uses as much as digits as its factorization.
1203104113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1203104113 is about 34685.7912263797. The cubic root of 1203104113 is about 1063.5740614379.
Adding to 1203104113 its reverse (3114013021), we get a palindrome (4317117134).
The spelling of 1203104113 in words is "one billion, two hundred three million, one hundred four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •