Base | Representation |
---|---|
bin | 100000010101000001111000… |
… | …0010101010100101010001101 |
3 | 1101021212001100120221100211001 |
4 | 1000222003300111110222031 |
5 | 244233014441033330203 |
6 | 2444443325355100301 |
7 | 113616465261463051 |
oct | 10052036025245215 |
9 | 1337761316840731 |
10 | 284365226855053 |
11 | 8267568519aa33 |
12 | 27a87a77141691 |
13 | c2896ab331b36 |
14 | 50314c9783c61 |
15 | 22d1ed36ac91d |
hex | 102a0f0554a8d |
284365226855053 has 2 divisors, whose sum is σ = 284365226855054. Its totient is φ = 284365226855052.
The previous prime is 284365226854991. The next prime is 284365226855089. The reversal of 284365226855053 is 350558622563482.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 238366488130884 + 45998738724169 = 15439122^2 + 6782237^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-284365226855053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (284365226855153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 142182613427526 + 142182613427527.
It is an arithmetic number, because the mean of its divisors is an integer number (142182613427527).
Almost surely, 2284365226855053 is an apocalyptic number.
It is an amenable number.
284365226855053 is a deficient number, since it is larger than the sum of its proper divisors (1).
284365226855053 is an equidigital number, since it uses as much as digits as its factorization.
284365226855053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720000, while the sum is 64.
The spelling of 284365226855053 in words is "two hundred eighty-four trillion, three hundred sixty-five billion, two hundred twenty-six million, eight hundred fifty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •