Base | Representation |
---|---|
bin | 101011001111011010111… |
… | …000000110101011011001 |
3 | 101112001221120012222022221 |
4 | 223033122320012223121 |
5 | 342141110100321131 |
6 | 10153030304344041 |
7 | 424453255601464 |
oct | 53173270065331 |
9 | 11461846188287 |
10 | 2971494542041 |
11 | a46227225263 |
12 | 3bba8b615021 |
13 | 187297c98a0c |
14 | a3b6d1702db |
15 | 52466e37411 |
hex | 2b3dae06ad9 |
2971494542041 has 2 divisors, whose sum is σ = 2971494542042. Its totient is φ = 2971494542040.
The previous prime is 2971494541999. The next prime is 2971494542087. The reversal of 2971494542041 is 1402454941792.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2908375516816 + 63119025225 = 1705396^2 + 251235^2 .
It is a cyclic number.
It is not a de Polignac number, because 2971494542041 - 27 = 2971494541913 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2971494542041.
It is not a weakly prime, because it can be changed into another prime (2971494542941) 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, 1485747271020 + 1485747271021.
It is an arithmetic number, because the mean of its divisors is an integer number (1485747271021).
Almost surely, 22971494542041 is an apocalyptic number.
It is an amenable number.
2971494542041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2971494542041 is an equidigital number, since it uses as much as digits as its factorization.
2971494542041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 52.
The spelling of 2971494542041 in words is "two trillion, nine hundred seventy-one billion, four hundred ninety-four million, five hundred forty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •