Base | Representation |
---|---|
bin | 100111000111011101111… |
… | …100111010011111110101 |
3 | 100111222101210112210010121 |
4 | 213013131330322133311 |
5 | 323020141020333411 |
6 | 5414515222451541 |
7 | 365131041331204 |
oct | 47073574723765 |
9 | 10458353483117 |
10 | 2688078292981 |
11 | 94700a133554 |
12 | 374b73b93bb1 |
13 | 16663bb4cbb3 |
14 | 9416471723b |
15 | 49dca62c571 |
hex | 271ddf3a7f5 |
2688078292981 has 2 divisors, whose sum is σ = 2688078292982. Its totient is φ = 2688078292980.
The previous prime is 2688078292951. The next prime is 2688078293009. The reversal of 2688078292981 is 1892928708862.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1589793156900 + 1098285136081 = 1260870^2 + 1047991^2 .
It is a cyclic number.
It is not a de Polignac number, because 2688078292981 - 29 = 2688078292469 is a prime.
It is a super-2 number, since 2×26880782929812 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2688078292981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2688078292951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1344039146490 + 1344039146491.
It is an arithmetic number, because the mean of its divisors is an integer number (1344039146491).
Almost surely, 22688078292981 is an apocalyptic number.
It is an amenable number.
2688078292981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2688078292981 is an equidigital number, since it uses as much as digits as its factorization.
2688078292981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 111476736, while the sum is 70.
The spelling of 2688078292981 in words is "two trillion, six hundred eighty-eight billion, seventy-eight million, two hundred ninety-two thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •