Base | Representation |
---|---|
bin | 1100011110111100… |
… | …01001101011010101 |
3 | 122022002000112122221 |
4 | 12033132021223111 |
5 | 102211203410031 |
6 | 3025011222341 |
7 | 325040112625 |
oct | 61736115325 |
9 | 18262015587 |
10 | 6702013141 |
11 | 292a12573a |
12 | 13705a79b1 |
13 | 82a661565 |
14 | 47814c885 |
15 | 2935a6a11 |
hex | 18f789ad5 |
6702013141 has 2 divisors, whose sum is σ = 6702013142. Its totient is φ = 6702013140.
The previous prime is 6702013117. The next prime is 6702013147. The reversal of 6702013141 is 1413102076.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4544782225 + 2157230916 = 67415^2 + 46446^2 .
It is a cyclic number.
It is not a de Polignac number, because 6702013141 - 231 = 4554529493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6702013147) 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, 3351006570 + 3351006571.
It is an arithmetic number, because the mean of its divisors is an integer number (3351006571).
Almost surely, 26702013141 is an apocalyptic number.
It is an amenable number.
6702013141 is a deficient number, since it is larger than the sum of its proper divisors (1).
6702013141 is an equidigital number, since it uses as much as digits as its factorization.
6702013141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 25.
The square root of 6702013141 is about 81865.8240109999. The cubic root of 6702013141 is about 1885.3924270745.
The spelling of 6702013141 in words is "six billion, seven hundred two million, thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •