Base | Representation |
---|---|
bin | 100000010101000001111000… |
… | …0010101010100100111110101 |
3 | 1101021212001100120221100121102 |
4 | 1000222003300111110213311 |
5 | 244233014441033324101 |
6 | 2444443325355055445 |
7 | 113616465261462443 |
oct | 10052036025244765 |
9 | 1337761316840542 |
10 | 284365226854901 |
11 | 8267568519a905 |
12 | 27a87a77141585 |
13 | c2896ab331a4a |
14 | 50314c9783b93 |
15 | 22d1ed36ac86b |
hex | 102a0f05549f5 |
284365226854901 has 2 divisors, whose sum is σ = 284365226854902. Its totient is φ = 284365226854900.
The previous prime is 284365226854889. The next prime is 284365226854927. The reversal of 284365226854901 is 109458622563482.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 233803243471876 + 50561983383025 = 15290626^2 + 7110695^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-284365226854901 is a prime.
It is a super-2 number, since 2×2843652268549012 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (284365226854991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 142182613427450 + 142182613427451.
It is an arithmetic number, because the mean of its divisors is an integer number (142182613427451).
Almost surely, 2284365226854901 is an apocalyptic number.
It is an amenable number.
284365226854901 is a deficient number, since it is larger than the sum of its proper divisors (1).
284365226854901 is an equidigital number, since it uses as much as digits as its factorization.
284365226854901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 199065600, while the sum is 65.
The spelling of 284365226854901 in words is "two hundred eighty-four trillion, three hundred sixty-five billion, two hundred twenty-six million, eight hundred fifty-four thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •