Base | Representation |
---|---|
bin | 1001100011010000011101111… |
… | …0110000111001100000100101 |
3 | 10021010122122121101212202201101 |
4 | 2120310013132300321200211 |
5 | 1201042413041242241142 |
6 | 10341223210322400101 |
7 | 261364334544360052 |
oct | 23064073660714045 |
9 | 3233578541782641 |
10 | 672084514805797 |
11 | 185168495445395 |
12 | 63466594200031 |
13 | 22b023b436b402 |
14 | bbd70c7ba0029 |
15 | 52a76d96c50b7 |
hex | 26341dec39825 |
672084514805797 has 2 divisors, whose sum is σ = 672084514805798. Its totient is φ = 672084514805796.
The previous prime is 672084514805713. The next prime is 672084514805831. The reversal of 672084514805797 is 797508415480276.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 662870624883076 + 9213889922721 = 25746274^2 + 3035439^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-672084514805797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (672084514802797) 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, 336042257402898 + 336042257402899.
It is an arithmetic number, because the mean of its divisors is an integer number (336042257402899).
Almost surely, 2672084514805797 is an apocalyptic number.
It is an amenable number.
672084514805797 is a deficient number, since it is larger than the sum of its proper divisors (1).
672084514805797 is an equidigital number, since it uses as much as digits as its factorization.
672084514805797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 948326400, while the sum is 73.
The spelling of 672084514805797 in words is "six hundred seventy-two trillion, eighty-four billion, five hundred fourteen million, eight hundred five thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •