Base | Representation |
---|---|
bin | 100001001100001011001… |
… | …010001010100000111101 |
3 | 22002001011220112011212021 |
4 | 201030023022022200331 |
5 | 244332102100114221 |
6 | 4503443013440141 |
7 | 323532501221011 |
oct | 41141312124075 |
9 | 8061156464767 |
10 | 2280814848061 |
11 | 7aa319580512 |
12 | 30a054340051 |
13 | 137106769669 |
14 | 7c56ba1c541 |
15 | 3e4e122c041 |
hex | 2130b28a83d |
2280814848061 has 2 divisors, whose sum is σ = 2280814848062. Its totient is φ = 2280814848060.
The previous prime is 2280814847977. The next prime is 2280814848097. The reversal of 2280814848061 is 1608484180822.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1370280948100 + 910533899961 = 1170590^2 + 954219^2 .
It is a cyclic number.
It is not a de Polignac number, because 2280814848061 - 225 = 2280781293629 is a prime.
It is a super-2 number, since 2×22808148480612 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2280814848761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1140407424030 + 1140407424031.
It is an arithmetic number, because the mean of its divisors is an integer number (1140407424031).
Almost surely, 22280814848061 is an apocalyptic number.
It is an amenable number.
2280814848061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2280814848061 is an equidigital number, since it uses as much as digits as its factorization.
2280814848061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1572864, while the sum is 52.
The spelling of 2280814848061 in words is "two trillion, two hundred eighty billion, eight hundred fourteen million, eight hundred forty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •