Base | Representation |
---|---|
bin | 100001001110000001110… |
… | …111101101011010110001 |
3 | 22002020022201011112022121 |
4 | 201032001313231122301 |
5 | 244400141430431433 |
6 | 4504412401434241 |
7 | 323633034040336 |
oct | 41160167553261 |
9 | 8066281145277 |
10 | 2282806498993 |
11 | 800150835319 |
12 | 30a50b33b981 |
13 | 13736327c737 |
14 | 7c6ba34298d |
15 | 3e5aaee0c2d |
hex | 21381ded6b1 |
2282806498993 has 2 divisors, whose sum is σ = 2282806498994. Its totient is φ = 2282806498992.
The previous prime is 2282806498913. The next prime is 2282806499003. The reversal of 2282806498993 is 3998946082822.
2282806498993 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1822265107569 + 460541391424 = 1349913^2 + 678632^2 .
It is a cyclic number.
It is not a de Polignac number, because 2282806498993 - 217 = 2282806367921 is a prime.
It is a super-2 number, since 2×22828064989932 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2282806498913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1141403249496 + 1141403249497.
It is an arithmetic number, because the mean of its divisors is an integer number (1141403249497).
Almost surely, 22282806498993 is an apocalyptic number.
It is an amenable number.
2282806498993 is a deficient number, since it is larger than the sum of its proper divisors (1).
2282806498993 is an equidigital number, since it uses as much as digits as its factorization.
2282806498993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 214990848, while the sum is 70.
The spelling of 2282806498993 in words is "two trillion, two hundred eighty-two billion, eight hundred six million, four hundred ninety-eight thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •