Base | Representation |
---|---|
bin | 1100111101011111… |
… | …11001110100111101 |
3 | 122221221022112111201 |
4 | 12132233321310331 |
5 | 103222312400203 |
6 | 3110245015501 |
7 | 334301533651 |
oct | 63657716475 |
9 | 18857275451 |
10 | 6958325053 |
11 | 2a5087a669 |
12 | 14223b4591 |
13 | 86b7a3c04 |
14 | 4a01cca61 |
15 | 2aad35e1d |
hex | 19ebf9d3d |
6958325053 has 2 divisors, whose sum is σ = 6958325054. Its totient is φ = 6958325052.
The previous prime is 6958325051. The next prime is 6958325081. The reversal of 6958325053 is 3505238596.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6842267524 + 116057529 = 82718^2 + 10773^2 .
It is a cyclic number.
It is not a de Polignac number, because 6958325053 - 21 = 6958325051 is a prime.
Together with 6958325051, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 6958324994 and 6958325012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6958325051) 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, 3479162526 + 3479162527.
It is an arithmetic number, because the mean of its divisors is an integer number (3479162527).
Almost surely, 26958325053 is an apocalyptic number.
It is an amenable number.
6958325053 is a deficient number, since it is larger than the sum of its proper divisors (1).
6958325053 is an equidigital number, since it uses as much as digits as its factorization.
6958325053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972000, while the sum is 46.
The square root of 6958325053 is about 83416.5754092075. The cubic root of 6958325053 is about 1909.1273713604.
The spelling of 6958325053 in words is "six billion, nine hundred fifty-eight million, three hundred twenty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •