Base | Representation |
---|---|
bin | 11000100000011100101… |
… | …001010010100111000101 |
3 | 12221222222100212200212121 |
4 | 120200130221102213011 |
5 | 210043023042004323 |
6 | 3325400214045541 |
7 | 232446521551315 |
oct | 30403451224705 |
9 | 5858870780777 |
10 | 1684107766213 |
11 | 59a253a25084 |
12 | 2324843498b1 |
13 | c2a700b1c42 |
14 | 5b722c2d445 |
15 | 2dc1a513a5d |
hex | 1881ca529c5 |
1684107766213 has 2 divisors, whose sum is σ = 1684107766214. Its totient is φ = 1684107766212.
The previous prime is 1684107766067. The next prime is 1684107766241. The reversal of 1684107766213 is 3126677014861.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1643890672449 + 40217093764 = 1282143^2 + 200542^2 .
It is a cyclic number.
It is not a de Polignac number, because 1684107766213 - 217 = 1684107635141 is a prime.
It is a super-2 number, since 2×16841077662132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1684107763213) 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, 842053883106 + 842053883107.
It is an arithmetic number, because the mean of its divisors is an integer number (842053883107).
Almost surely, 21684107766213 is an apocalyptic number.
It is an amenable number.
1684107766213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1684107766213 is an equidigital number, since it uses as much as digits as its factorization.
1684107766213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2032128, while the sum is 52.
The spelling of 1684107766213 in words is "one trillion, six hundred eighty-four billion, one hundred seven million, seven hundred sixty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •