Base | Representation |
---|---|
bin | 1001100100111111010100110… |
… | …1000101100110100011110101 |
3 | 10021101101201111202221212220012 |
4 | 2121033311031011212203311 |
5 | 1201320114021234122333 |
6 | 10345242142214350005 |
7 | 261652046424425651 |
oct | 23117651505464365 |
9 | 3241351452855805 |
10 | 673989036239093 |
11 | 18583216610a903 |
12 | 6371371065b305 |
13 | 22c0cb7ca62463 |
14 | bc61359cb7a61 |
15 | 52dc00538be48 |
hex | 264fd4d1668f5 |
673989036239093 has 2 divisors, whose sum is σ = 673989036239094. Its totient is φ = 673989036239092.
The previous prime is 673989036239059. The next prime is 673989036239117. The reversal of 673989036239093 is 390932630989376.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 615646906446289 + 58342129792804 = 24812233^2 + 7638202^2 .
It is a cyclic number.
It is not a de Polignac number, because 673989036239093 - 220 = 673989035190517 is a prime.
It is a super-2 number, since 2×6739890362390932 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (673989036235093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 336994518119546 + 336994518119547.
It is an arithmetic number, because the mean of its divisors is an integer number (336994518119547).
Almost surely, 2673989036239093 is an apocalyptic number.
It is an amenable number.
673989036239093 is a deficient number, since it is larger than the sum of its proper divisors (1).
673989036239093 is an equidigital number, since it uses as much as digits as its factorization.
673989036239093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2142770112, while the sum is 77.
The spelling of 673989036239093 in words is "six hundred seventy-three trillion, nine hundred eighty-nine billion, thirty-six million, two hundred thirty-nine thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •