Base | Representation |
---|---|
bin | 101011001110111000001… |
… | …001100110111100001111 |
3 | 101112000102221221010020001 |
4 | 223032320021212330033 |
5 | 342133411423144304 |
6 | 10152452413105131 |
7 | 424432652503504 |
oct | 53167011467417 |
9 | 11460387833201 |
10 | 2970911928079 |
11 | a45a58371817 |
12 | 3bb9484881a7 |
13 | 187204379824 |
14 | a3b15a314ab |
15 | 52430c00da4 |
hex | 2b3b8266f0f |
2970911928079 has 2 divisors, whose sum is σ = 2970911928080. Its totient is φ = 2970911928078.
The previous prime is 2970911928059. The next prime is 2970911928143. The reversal of 2970911928079 is 9708291190792.
It is a happy number.
It is an a-pointer prime, because the next prime (2970911928143) can be obtained adding 2970911928079 to its sum of digits (64).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2970911928079 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2970911928079.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2970911928059) 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, 1485455964039 + 1485455964040.
It is an arithmetic number, because the mean of its divisors is an integer number (1485455964040).
Almost surely, 22970911928079 is an apocalyptic number.
2970911928079 is a deficient number, since it is larger than the sum of its proper divisors (1).
2970911928079 is an equidigital number, since it uses as much as digits as its factorization.
2970911928079 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10287648, while the sum is 64.
The spelling of 2970911928079 in words is "two trillion, nine hundred seventy billion, nine hundred eleven million, nine hundred twenty-eight thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •