Base | Representation |
---|---|
bin | 110001011100111110001… |
… | …1001100101101000101001 |
3 | 220001202112110211120110021 |
4 | 1202321330121211220221 |
5 | 1342324143142013214 |
6 | 22242212244120441 |
7 | 1301022122130421 |
oct | 142717431455051 |
9 | 26052473746407 |
10 | 6796725344809 |
11 | 21905252a3244 |
12 | 919301696121 |
13 | 3a3c0ba5c27a |
14 | 196d6b295481 |
15 | bbbe9a31924 |
hex | 62e7c665a29 |
6796725344809 has 9 divisors (see below), whose sum is σ = 6843038193957. Its totient is φ = 6750723894624.
The previous prime is 6796725344797. The next prime is 6796725344831. The reversal of 6796725344809 is 9084435276976.
The square root of 6796725344809 is 2607053.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 5752298576025 + 1044426768784 = 2398395^2 + 1021972^2 .
It is not a de Polignac number, because 6796725344809 - 235 = 6762365606441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6796725344879) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 388442149 + ... + 388459645.
Almost surely, 26796725344809 is an apocalyptic number.
6796725344809 is the 2607053-rd square number.
6796725344809 is the 1303527-th centered octagonal number.
It is an amenable number.
6796725344809 is a deficient number, since it is larger than the sum of its proper divisors (46312849148).
6796725344809 is an frugal number, since it uses more digits than its factorization.
6796725344809 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35292 (or 17646 counting only the distinct ones).
The product of its (nonzero) digits is 548674560, while the sum is 70.
The spelling of 6796725344809 in words is "six trillion, seven hundred ninety-six billion, seven hundred twenty-five million, three hundred forty-four thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •