Base | Representation |
---|---|
bin | 11101111100110101111… |
… | …110000100100100001101 |
3 | 21021202120010121221021212 |
4 | 131330311332010210031 |
5 | 232210140332030421 |
6 | 4213304401304205 |
7 | 301461662063465 |
oct | 35746576044415 |
9 | 7252503557255 |
10 | 2058194798861 |
11 | 72396a341583 |
12 | 292a85335065 |
13 | 11c118ccccb6 |
14 | 7188d6b4ba5 |
15 | 38811eeae5b |
hex | 1df35f8490d |
2058194798861 has 2 divisors, whose sum is σ = 2058194798862. Its totient is φ = 2058194798860.
The previous prime is 2058194798843. The next prime is 2058194798887. The reversal of 2058194798861 is 1688974918502.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1564765820836 + 493428978025 = 1250906^2 + 702445^2 .
It is a cyclic number.
It is not a de Polignac number, because 2058194798861 - 222 = 2058190604557 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2058194798791 and 2058194798800.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2058194708861) 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, 1029097399430 + 1029097399431.
It is an arithmetic number, because the mean of its divisors is an integer number (1029097399431).
Almost surely, 22058194798861 is an apocalyptic number.
It is an amenable number.
2058194798861 is a deficient number, since it is larger than the sum of its proper divisors (1).
2058194798861 is an equidigital number, since it uses as much as digits as its factorization.
2058194798861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69672960, while the sum is 68.
The spelling of 2058194798861 in words is "two trillion, fifty-eight billion, one hundred ninety-four million, seven hundred ninety-eight thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •