Base | Representation |
---|---|
bin | 11110101000001100101… |
… | …101011000110111101101 |
3 | 21110012201110011221100022 |
4 | 132220030231120313231 |
5 | 233441010240344411 |
6 | 4250524005011525 |
7 | 305030412004526 |
oct | 36501455306755 |
9 | 7405643157308 |
10 | 2104747199981 |
11 | 741688a18558 |
12 | 29bab76b3ba5 |
13 | 12362771c68a |
14 | 73c281a784d |
15 | 39b38d84edb |
hex | 1ea0cb58ded |
2104747199981 has 2 divisors, whose sum is σ = 2104747199982. Its totient is φ = 2104747199980.
The previous prime is 2104747199969. The next prime is 2104747200041. The reversal of 2104747199981 is 1899917474012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1512262927081 + 592484272900 = 1229741^2 + 769730^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2104747199981 is a prime.
It is a super-2 number, since 2×21047471999812 (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 (2104747193981) 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, 1052373599990 + 1052373599991.
It is an arithmetic number, because the mean of its divisors is an integer number (1052373599991).
Almost surely, 22104747199981 is an apocalyptic number.
It is an amenable number.
2104747199981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2104747199981 is an equidigital number, since it uses as much as digits as its factorization.
2104747199981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9144576, while the sum is 62.
The spelling of 2104747199981 in words is "two trillion, one hundred four billion, seven hundred forty-seven million, one hundred ninety-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •