Base | Representation |
---|---|
bin | 111110101111000… |
… | …101000000101001 |
3 | 2201100111222220202 |
4 | 332233011000221 |
5 | 4123421404211 |
6 | 252235201545 |
7 | 35040226511 |
oct | 7657050051 |
9 | 2640458822 |
10 | 1052528681 |
11 | 4a0141416 |
12 | 2545a62b5 |
13 | 13a09c549 |
14 | 9db02841 |
15 | 6260a53b |
hex | 3ebc5029 |
1052528681 has 2 divisors, whose sum is σ = 1052528682. Its totient is φ = 1052528680.
The previous prime is 1052528663. The next prime is 1052528683. The reversal of 1052528681 is 1868252501.
1052528681 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., 1042256656 + 10272025 = 32284^2 + 3205^2 .
It is a cyclic number.
It is not a de Polignac number, because 1052528681 - 214 = 1052512297 is a prime.
It is a super-2 number, since 2×10525286812 = 2215633248655199522, which contains 22 as substring.
Together with 1052528683, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1052528683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526264340 + 526264341.
It is an arithmetic number, because the mean of its divisors is an integer number (526264341).
Almost surely, 21052528681 is an apocalyptic number.
It is an amenable number.
1052528681 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052528681 is an equidigital number, since it uses as much as digits as its factorization.
1052528681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38400, while the sum is 38.
The square root of 1052528681 is about 32442.6984235282. The cubic root of 1052528681 is about 1017.2116208514.
The spelling of 1052528681 in words is "one billion, fifty-two million, five hundred twenty-eight thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •