Base | Representation |
---|---|
bin | 1100110001000000… |
… | …10010100111100001 |
3 | 122200122012101012122 |
4 | 12120200102213201 |
5 | 103014003201433 |
6 | 3052023434025 |
7 | 331560242465 |
oct | 63040224741 |
9 | 18618171178 |
10 | 6853568993 |
11 | 29a772a907 |
12 | 13b32b5915 |
13 | 852b8668b |
14 | 4903204a5 |
15 | 2a1a42198 |
hex | 1988129e1 |
6853568993 has 2 divisors, whose sum is σ = 6853568994. Its totient is φ = 6853568992.
The previous prime is 6853568899. The next prime is 6853569031. The reversal of 6853568993 is 3998653586.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6830691904 + 22877089 = 82648^2 + 4783^2 .
It is a cyclic number.
It is not a de Polignac number, because 6853568993 - 224 = 6836791777 is a prime.
It is a super-2 number, since 2×68535689932 = 93942815883622068098, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (6853568093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3426784496 + 3426784497.
It is an arithmetic number, because the mean of its divisors is an integer number (3426784497).
Almost surely, 26853568993 is an apocalyptic number.
It is an amenable number.
6853568993 is a deficient number, since it is larger than the sum of its proper divisors (1).
6853568993 is an equidigital number, since it uses as much as digits as its factorization.
6853568993 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41990400, while the sum is 62.
The square root of 6853568993 is about 82786.2850537455. The cubic root of 6853568993 is about 1899.4983895597.
The spelling of 6853568993 in words is "six billion, eight hundred fifty-three million, five hundred sixty-eight thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •