Base | Representation |
---|---|
bin | 11101110100101110100… |
… | …111111101101001111001 |
3 | 21020221001220021000021101 |
4 | 131310232213331221321 |
5 | 232034314244101111 |
6 | 4205304024011401 |
7 | 301033031256013 |
oct | 35645647755171 |
9 | 7227056230241 |
10 | 2049481628281 |
11 | 7201a8a4955a |
12 | 291253300b61 |
13 | 11b35aab8a69 |
14 | 712a44051b3 |
15 | 384a20cabc1 |
hex | 1dd2e9fda79 |
2049481628281 has 2 divisors, whose sum is σ = 2049481628282. Its totient is φ = 2049481628280.
The previous prime is 2049481628279. The next prime is 2049481628377. The reversal of 2049481628281 is 1828261849402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1830378997225 + 219102631056 = 1352915^2 + 468084^2 .
It is a cyclic number.
It is not a de Polignac number, because 2049481628281 - 21 = 2049481628279 is a prime.
It is a super-2 number, since 2×20494816282812 (a number of 25 digits) contains 22 as substring.
Together with 2049481628279, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2049481628681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1024740814140 + 1024740814141.
It is an arithmetic number, because the mean of its divisors is an integer number (1024740814141).
Almost surely, 22049481628281 is an apocalyptic number.
It is an amenable number.
2049481628281 is a deficient number, since it is larger than the sum of its proper divisors (1).
2049481628281 is an equidigital number, since it uses as much as digits as its factorization.
2049481628281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3538944, while the sum is 55.
It can be divided in two parts, 2049481 and 628281, that added together give a palindrome (2677762).
The spelling of 2049481628281 in words is "two trillion, forty-nine billion, four hundred eighty-one million, six hundred twenty-eight thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •