Base | Representation |
---|---|
bin | 100110011101100001000… |
… | …110101010110001010001 |
3 | 100100200010120210212212121 |
4 | 212131201012222301101 |
5 | 321300413202300131 |
6 | 5342105411454241 |
7 | 361644563350654 |
oct | 46354106526121 |
9 | 10320116725777 |
10 | 2643034025041 |
11 | 9299a4892333 |
12 | 3682a28b7381 |
13 | 162310a0c707 |
14 | 91cd024389b |
15 | 48b40d97911 |
hex | 267611aac51 |
2643034025041 has 2 divisors, whose sum is σ = 2643034025042. Its totient is φ = 2643034025040.
The previous prime is 2643034025039. The next prime is 2643034025081. The reversal of 2643034025041 is 1405204303462.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1923480514816 + 719553510225 = 1386896^2 + 848265^2 .
It is a cyclic number.
It is not a de Polignac number, because 2643034025041 - 21 = 2643034025039 is a prime.
Together with 2643034025039, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2643034024988 and 2643034025006.
It is not a weakly prime, because it can be changed into another prime (2643034025081) 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, 1321517012520 + 1321517012521.
It is an arithmetic number, because the mean of its divisors is an integer number (1321517012521).
Almost surely, 22643034025041 is an apocalyptic number.
It is an amenable number.
2643034025041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2643034025041 is an equidigital number, since it uses as much as digits as its factorization.
2643034025041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 34.
The spelling of 2643034025041 in words is "two trillion, six hundred forty-three billion, thirty-four million, twenty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •