Base | Representation |
---|---|
bin | 1001011010110100011011100… |
… | …0110001101111010010010001 |
3 | 10012220210201001220001221011101 |
4 | 2112231012320301233102101 |
5 | 1143333411210010214442 |
6 | 10305401114440144401 |
7 | 256416131050004443 |
oct | 22655067061572221 |
9 | 3186721056057141 |
10 | 662806748132497 |
11 | 182210843a91431 |
12 | 6240847aa68101 |
13 | 225ab53c957347 |
14 | b996036ad2493 |
15 | 51961d06a6cb7 |
hex | 25ad1b8c6f491 |
662806748132497 has 2 divisors, whose sum is σ = 662806748132498. Its totient is φ = 662806748132496.
The previous prime is 662806748132429. The next prime is 662806748132531. The reversal of 662806748132497 is 794231847608266.
662806748132497 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 661534655139856 + 1272092992641 = 25720316^2 + 1127871^2 .
It is a cyclic number.
It is not a de Polignac number, because 662806748132497 - 215 = 662806748099729 is a prime.
It is not a weakly prime, because it can be changed into another prime (662806748132897) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 331403374066248 + 331403374066249.
It is an arithmetic number, because the mean of its divisors is an integer number (331403374066249).
Almost surely, 2662806748132497 is an apocalyptic number.
It is an amenable number.
662806748132497 is a deficient number, since it is larger than the sum of its proper divisors (1).
662806748132497 is an equidigital number, since it uses as much as digits as its factorization.
662806748132497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1170505728, while the sum is 73.
The spelling of 662806748132497 in words is "six hundred sixty-two trillion, eight hundred six billion, seven hundred forty-eight million, one hundred thirty-two thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •