Base | Representation |
---|---|
bin | 110010110001100100101… |
… | …0110100111101011001101 |
3 | 220201010111001020021200101 |
4 | 1211203021112213223031 |
5 | 1403313233142220142 |
6 | 22501500210331101 |
7 | 1320113245060513 |
oct | 145431126475315 |
9 | 26633431207611 |
10 | 6978405038797 |
11 | 2250585799375 |
12 | 948565889a91 |
13 | 3b80a369058a |
14 | 1a1a841ac4b3 |
15 | c17ce92c0b7 |
hex | 658c95a7acd |
6978405038797 has 2 divisors, whose sum is σ = 6978405038798. Its totient is φ = 6978405038796.
The previous prime is 6978405038789. The next prime is 6978405038807. The reversal of 6978405038797 is 7978305048796.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3564313667721 + 3414091371076 = 1887939^2 + 1847726^2 .
It is a cyclic number.
It is not a de Polignac number, because 6978405038797 - 23 = 6978405038789 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6978405008797) 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, 3489202519398 + 3489202519399.
It is an arithmetic number, because the mean of its divisors is an integer number (3489202519399).
Almost surely, 26978405038797 is an apocalyptic number.
It is an amenable number.
6978405038797 is a deficient number, since it is larger than the sum of its proper divisors (1).
6978405038797 is an equidigital number, since it uses as much as digits as its factorization.
6978405038797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 640120320, while the sum is 73.
Subtracting 6978405038797 from its reverse (7978305048796), we obtain a palindrome (999900009999).
The spelling of 6978405038797 in words is "six trillion, nine hundred seventy-eight billion, four hundred five million, thirty-eight thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •