Base | Representation |
---|---|
bin | 11101000001110000011… |
… | …10010000110011010001 |
3 | 10112100101211021221012002 |
4 | 32200320032100303101 |
5 | 112320111133104401 |
6 | 2042104342043345 |
7 | 132025620235334 |
oct | 16407016206321 |
9 | 3470354257162 |
10 | 997375675601 |
11 | 354a91627158 |
12 | 14136b119555 |
13 | 7308a68a076 |
14 | 363b7ab261b |
15 | 1ae2617da6b |
hex | e838390cd1 |
997375675601 has 2 divisors, whose sum is σ = 997375675602. Its totient is φ = 997375675600.
The previous prime is 997375675577. The next prime is 997375675603. The reversal of 997375675601 is 106576573799.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 912913366225 + 84462309376 = 955465^2 + 290624^2 .
It is a cyclic number.
It is not a de Polignac number, because 997375675601 - 26 = 997375675537 is a prime.
It is a super-2 number, since 2×9973756756012 (a number of 25 digits) contains 22 as substring.
Together with 997375675603, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (997375675603) 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, 498687837800 + 498687837801.
It is an arithmetic number, because the mean of its divisors is an integer number (498687837801).
Almost surely, 2997375675601 is an apocalyptic number.
It is an amenable number.
997375675601 is a deficient number, since it is larger than the sum of its proper divisors (1).
997375675601 is an equidigital number, since it uses as much as digits as its factorization.
997375675601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75014100, while the sum is 65.
The spelling of 997375675601 in words is "nine hundred ninety-seven billion, three hundred seventy-five million, six hundred seventy-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •