Base | Representation |
---|---|
bin | 11101011101010111101… |
… | …00100101001001000101 |
3 | 10120202122221212202011022 |
4 | 32232223310211021011 |
5 | 113040441200031432 |
6 | 2052555342520525 |
7 | 133062155026223 |
oct | 16565364451105 |
9 | 3522587782138 |
10 | 1012200002117 |
11 | 3602a9571077 |
12 | 144207896145 |
13 | 745b09b85c5 |
14 | 36dc2847b13 |
15 | 1b4e2841b12 |
hex | ebabd25245 |
1012200002117 has 2 divisors, whose sum is σ = 1012200002118. Its totient is φ = 1012200002116.
The previous prime is 1012200002087. The next prime is 1012200002147. The reversal of 1012200002117 is 7112000022101.
It is a balanced prime because it is at equal distance from previous prime (1012200002087) and next prime (1012200002147).
It can be written as a sum of positive squares in only one way, i.e., 966300796036 + 45899206081 = 983006^2 + 214241^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012200002117 - 226 = 1012132893253 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012200002095 and 1012200002104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012200002147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506100001058 + 506100001059.
It is an arithmetic number, because the mean of its divisors is an integer number (506100001059).
Almost surely, 21012200002117 is an apocalyptic number.
It is an amenable number.
1012200002117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012200002117 is an equidigital number, since it uses as much as digits as its factorization.
1012200002117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 1012200002117 its reverse (7112000022101), we get a palindrome (8124200024218).
The spelling of 1012200002117 in words is "one trillion, twelve billion, two hundred million, two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •