Base | Representation |
---|---|
bin | 10000111011110… |
… | …001111010110101 |
3 | 201210121002202001 |
4 | 100323301322311 |
5 | 1040212401141 |
6 | 44105215301 |
7 | 10016602414 |
oct | 2073617265 |
9 | 653532661 |
10 | 284106421 |
11 | 1364093a5 |
12 | 7b191531 |
13 | 46b24811 |
14 | 29a3747b |
15 | 19e1ea31 |
hex | 10ef1eb5 |
284106421 has 2 divisors, whose sum is σ = 284106422. Its totient is φ = 284106420.
The previous prime is 284106391. The next prime is 284106439. The reversal of 284106421 is 124601482.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 208224900 + 75881521 = 14430^2 + 8711^2 .
It is a cyclic number.
It is not a de Polignac number, because 284106421 - 29 = 284105909 is a prime.
It is equal to p15437116 and since 284106421 and 15437116 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 284106421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (284106451) 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, 142053210 + 142053211.
It is an arithmetic number, because the mean of its divisors is an integer number (142053211).
Almost surely, 2284106421 is an apocalyptic number.
It is an amenable number.
284106421 is a deficient number, since it is larger than the sum of its proper divisors (1).
284106421 is an equidigital number, since it uses as much as digits as its factorization.
284106421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 28.
The square root of 284106421 is about 16855.4567128868. The cubic root of 284106421 is about 657.3959381736.
The spelling of 284106421 in words is "two hundred eighty-four million, one hundred six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •