Base | Representation |
---|---|
bin | 1100111100110010… |
… | …11101010100110101 |
3 | 122221112020121022001 |
4 | 12132121131110311 |
5 | 103214311104031 |
6 | 3105514535301 |
7 | 334200526462 |
oct | 63631352465 |
9 | 18845217261 |
10 | 6952441141 |
11 | 2a48520a28 |
12 | 1420437531 |
13 | 86a4c39c9 |
14 | 49d4da669 |
15 | 2aa572861 |
hex | 19e65d535 |
6952441141 has 2 divisors, whose sum is σ = 6952441142. Its totient is φ = 6952441140.
The previous prime is 6952441109. The next prime is 6952441157. The reversal of 6952441141 is 1411442596.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6331384900 + 621056241 = 79570^2 + 24921^2 .
It is a cyclic number.
It is not a de Polignac number, because 6952441141 - 25 = 6952441109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6952441141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6952441241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3476220570 + 3476220571.
It is an arithmetic number, because the mean of its divisors is an integer number (3476220571).
Almost surely, 26952441141 is an apocalyptic number.
It is an amenable number.
6952441141 is a deficient number, since it is larger than the sum of its proper divisors (1).
6952441141 is an equidigital number, since it uses as much as digits as its factorization.
6952441141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34560, while the sum is 37.
The square root of 6952441141 is about 83381.2997080281. The cubic root of 6952441141 is about 1908.5891046045.
The spelling of 6952441141 in words is "six billion, nine hundred fifty-two million, four hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •