Base | Representation |
---|---|
bin | 1100111110000011… |
… | …10001111001000101 |
3 | 122222021010121121112 |
4 | 12133001301321011 |
5 | 103230012324031 |
6 | 3110533254405 |
7 | 334356422012 |
oct | 63701617105 |
9 | 18867117545 |
10 | 6963011141 |
11 | 2a53490369 |
12 | 1423a94405 |
13 | 86c754b48 |
14 | 4a0a8c709 |
15 | 2ab45e62b |
hex | 19f071e45 |
6963011141 has 2 divisors, whose sum is σ = 6963011142. Its totient is φ = 6963011140.
The previous prime is 6963011101. The next prime is 6963011177. The reversal of 6963011141 is 1411103696.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6897966916 + 65044225 = 83054^2 + 8065^2 .
It is a cyclic number.
It is not a de Polignac number, because 6963011141 - 214 = 6962994757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6963011098 and 6963011107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6963011101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3481505570 + 3481505571.
It is an arithmetic number, because the mean of its divisors is an integer number (3481505571).
Almost surely, 26963011141 is an apocalyptic number.
It is an amenable number.
6963011141 is a deficient number, since it is larger than the sum of its proper divisors (1).
6963011141 is an equidigital number, since it uses as much as digits as its factorization.
6963011141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 32.
The square root of 6963011141 is about 83444.6591520392. The cubic root of 6963011141 is about 1909.5558428313. Note that the first 3 decimals are identical.
The spelling of 6963011141 in words is "six billion, nine hundred sixty-three million, eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •