Base | Representation |
---|---|
bin | 110001000010111111001… |
… | …1110010110011100000101 |
3 | 212212102111200201110102021 |
4 | 1202011332132112130011 |
5 | 1340420403421312434 |
6 | 22200423301243141 |
7 | 1264005263653525 |
oct | 142057636263405 |
9 | 25772450643367 |
10 | 6740925572869 |
11 | 21698a0828744 |
12 | 90a52a4034b1 |
13 | 39b88855a837 |
14 | 194396597685 |
15 | ba530e05cb4 |
hex | 6217e796705 |
6740925572869 has 2 divisors, whose sum is σ = 6740925572870. Its totient is φ = 6740925572868.
The previous prime is 6740925572789. The next prime is 6740925572893. The reversal of 6740925572869 is 9682755290476.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5776379628100 + 964545944769 = 2403410^2 + 982113^2 .
It is a cyclic number.
It is not a de Polignac number, because 6740925572869 - 29 = 6740925572357 is a prime.
It is a super-2 number, since 2×67409255728692 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6740925572798 and 6740925572807.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6740925572669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3370462786434 + 3370462786435.
It is an arithmetic number, because the mean of its divisors is an integer number (3370462786435).
Almost surely, 26740925572869 is an apocalyptic number.
It is an amenable number.
6740925572869 is a deficient number, since it is larger than the sum of its proper divisors (1).
6740925572869 is an equidigital number, since it uses as much as digits as its factorization.
6740925572869 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 457228800, while the sum is 70.
The spelling of 6740925572869 in words is "six trillion, seven hundred forty billion, nine hundred twenty-five million, five hundred seventy-two thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •