Base | Representation |
---|---|
bin | 110111110110100100010… |
… | …0100000010110010010001 |
3 | 1000011211221012211020100122 |
4 | 1233231020210002302101 |
5 | 2001232102413403342 |
6 | 24154242103200025 |
7 | 1421411315060633 |
oct | 157551044026221 |
9 | 30154835736318 |
10 | 7676323966097 |
11 | 249a568837276 |
12 | a3b881446015 |
13 | 438b49938747 |
14 | 1c7770d52a53 |
15 | d4a2ae5a4d2 |
hex | 6fb48902c91 |
7676323966097 has 2 divisors, whose sum is σ = 7676323966098. Its totient is φ = 7676323966096.
The previous prime is 7676323966019. The next prime is 7676323966127. The reversal of 7676323966097 is 7906693236767.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3842105696641 + 3834218269456 = 1960129^2 + 1958116^2 .
It is a cyclic number.
It is not a de Polignac number, because 7676323966097 - 214 = 7676323949713 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 7676323966097.
It is not a weakly prime, because it can be changed into another prime (7676323936097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3838161983048 + 3838161983049.
It is an arithmetic number, because the mean of its divisors is an integer number (3838161983049).
Almost surely, 27676323966097 is an apocalyptic number.
It is an amenable number.
7676323966097 is a deficient number, since it is larger than the sum of its proper divisors (1).
7676323966097 is an equidigital number, since it uses as much as digits as its factorization.
7676323966097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648121824, while the sum is 71.
The spelling of 7676323966097 in words is "seven trillion, six hundred seventy-six billion, three hundred twenty-three million, nine hundred sixty-six thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.398 sec. • engine limits •