Base | Representation |
---|---|
bin | 1100011010001… |
… | …0101111100101 |
3 | 10121221020211001 |
4 | 3012202233211 |
5 | 101310444241 |
6 | 5055313301 |
7 | 1201251001 |
oct | 306425745 |
9 | 117836731 |
10 | 52046821 |
11 | 27419602 |
12 | 1551b831 |
13 | aa23c48 |
14 | 6cab701 |
15 | 4881431 |
hex | 31a2be5 |
52046821 has 2 divisors, whose sum is σ = 52046822. Its totient is φ = 52046820.
The previous prime is 52046807. The next prime is 52046849. The reversal of 52046821 is 12864025.
It is an a-pointer prime, because the next prime (52046849) can be obtained adding 52046821 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 47761921 + 4284900 = 6911^2 + 2070^2 .
It is a cyclic number.
It is not a de Polignac number, because 52046821 - 25 = 52046789 is a prime.
It is a Chen prime.
It is equal to p3116476 and since 52046821 and 3116476 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 52046821.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52046881) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26023410 + 26023411.
It is an arithmetic number, because the mean of its divisors is an integer number (26023411).
Almost surely, 252046821 is an apocalyptic number.
It is an amenable number.
52046821 is a deficient number, since it is larger than the sum of its proper divisors (1).
52046821 is an equidigital number, since it uses as much as digits as its factorization.
52046821 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3840, while the sum is 28.
The square root of 52046821 is about 7214.3482727132. The cubic root of 52046821 is about 373.3631076558.
The spelling of 52046821 in words is "fifty-two million, forty-six thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •