Base | Representation |
---|---|
bin | 111011110110110100111… |
… | …110100100001001000101 |
3 | 112120020012100021021000121 |
4 | 323312310332210021011 |
5 | 1014343034410031432 |
6 | 12425344430541541 |
7 | 603114622064044 |
oct | 73666476441105 |
9 | 15506170237017 |
10 | 4113320002117 |
11 | 13464a39a8487 |
12 | 5652326678b1 |
13 | 23ab6608c021 |
14 | 10312b42855b |
15 | 71ee47a7197 |
hex | 3bdb4fa4245 |
4113320002117 has 2 divisors, whose sum is σ = 4113320002118. Its totient is φ = 4113320002116.
The previous prime is 4113320002073. The next prime is 4113320002199. The reversal of 4113320002117 is 7112000233114.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2366902248676 + 1746417753441 = 1538474^2 + 1321521^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4113320002117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4113320002091 and 4113320002100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4113320072117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2056660001058 + 2056660001059.
It is an arithmetic number, because the mean of its divisors is an integer number (2056660001059).
Almost surely, 24113320002117 is an apocalyptic number.
It is an amenable number.
4113320002117 is a deficient number, since it is larger than the sum of its proper divisors (1).
4113320002117 is an equidigital number, since it uses as much as digits as its factorization.
4113320002117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 25.
The spelling of 4113320002117 in words is "four trillion, one hundred thirteen billion, three hundred twenty million, two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •