Base | Representation |
---|---|
bin | 11000011100110000000… |
… | …011101001100101001101 |
3 | 12221121201201221212010112 |
4 | 120130300003221211031 |
5 | 210011410422211403 |
6 | 3323502302245405 |
7 | 232246253260235 |
oct | 30346003514515 |
9 | 5847651855115 |
10 | 1680138475853 |
11 | 5985a7406522 |
12 | 231756b86865 |
13 | c2589953516 |
14 | 5b4679d0cc5 |
15 | 2da86d079d8 |
hex | 187300e994d |
1680138475853 has 2 divisors, whose sum is σ = 1680138475854. Its totient is φ = 1680138475852.
The previous prime is 1680138475783. The next prime is 1680138475913. The reversal of 1680138475853 is 3585748310861.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1606764126724 + 73374349129 = 1267582^2 + 270877^2 .
It is an emirp because it is prime and its reverse (3585748310861) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1680138475853 - 232 = 1675843508557 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1680138475792 and 1680138475801.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1680138475553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 840069237926 + 840069237927.
It is an arithmetic number, because the mean of its divisors is an integer number (840069237927).
Almost surely, 21680138475853 is an apocalyptic number.
It is an amenable number.
1680138475853 is a deficient number, since it is larger than the sum of its proper divisors (1).
1680138475853 is an equidigital number, since it uses as much as digits as its factorization.
1680138475853 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19353600, while the sum is 59.
The spelling of 1680138475853 in words is "one trillion, six hundred eighty billion, one hundred thirty-eight million, four hundred seventy-five thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •