Base | Representation |
---|---|
bin | 101011011111000000000… |
… | …001011110010011100111 |
3 | 101120200010110102112010001 |
4 | 223133000001132103213 |
5 | 342424340303214341 |
6 | 10204434320242131 |
7 | 425614654623652 |
oct | 53370001362347 |
9 | 11520113375101 |
10 | 2988223882471 |
11 | a5233152a343 |
12 | 40317a170347 |
13 | 188a32b95019 |
14 | a48b8d16899 |
15 | 52ae5998d31 |
hex | 2b7c005e4e7 |
2988223882471 has 2 divisors, whose sum is σ = 2988223882472. Its totient is φ = 2988223882470.
The previous prime is 2988223882417. The next prime is 2988223882493. The reversal of 2988223882471 is 1742883228892.
2988223882471 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (2988223882417) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2988223882471 - 215 = 2988223849703 is a prime.
It is a super-3 number, since 3×29882238824713 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2988223822471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1494111941235 + 1494111941236.
It is an arithmetic number, because the mean of its divisors is an integer number (1494111941236).
Almost surely, 22988223882471 is an apocalyptic number.
2988223882471 is a deficient number, since it is larger than the sum of its proper divisors (1).
2988223882471 is an equidigital number, since it uses as much as digits as its factorization.
2988223882471 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 49545216, while the sum is 64.
The spelling of 2988223882471 in words is "two trillion, nine hundred eighty-eight billion, two hundred twenty-three million, eight hundred eighty-two thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •