Base | Representation |
---|---|
bin | 110001011101000001001… |
… | …0100010001000110001101 |
3 | 220001202210101121221011121 |
4 | 1202322002110101012031 |
5 | 1342324344100111021 |
6 | 22242230151520541 |
7 | 1301024435655004 |
oct | 142720224210615 |
9 | 26052711557147 |
10 | 6796824613261 |
11 | 2190576335091 |
12 | 91932a989151 |
13 | 3a3c264a7ab7 |
14 | 196d7a535c3b |
15 | bbc035de741 |
hex | 62e8251118d |
6796824613261 has 2 divisors, whose sum is σ = 6796824613262. Its totient is φ = 6796824613260.
The previous prime is 6796824613253. The next prime is 6796824613289. The reversal of 6796824613261 is 1623164286976.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6660626710761 + 136197902500 = 2580819^2 + 369050^2 .
It is a cyclic number.
It is not a de Polignac number, because 6796824613261 - 23 = 6796824613253 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6796824613261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6796824613291) 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, 3398412306630 + 3398412306631.
It is an arithmetic number, because the mean of its divisors is an integer number (3398412306631).
Almost surely, 26796824613261 is an apocalyptic number.
It is an amenable number.
6796824613261 is a deficient number, since it is larger than the sum of its proper divisors (1).
6796824613261 is an equidigital number, since it uses as much as digits as its factorization.
6796824613261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31352832, while the sum is 61.
The spelling of 6796824613261 in words is "six trillion, seven hundred ninety-six billion, eight hundred twenty-four million, six hundred thirteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •