Base | Representation |
---|---|
bin | 111110101110000… |
… | …100000011110001 |
3 | 2201100000110222102 |
4 | 332232010003301 |
5 | 4123334401031 |
6 | 252225350145 |
7 | 35035041053 |
oct | 7656040361 |
9 | 2640013872 |
10 | 1052262641 |
11 | 49aa7a551 |
12 | 254498355 |
13 | 13a008421 |
14 | 9da738d3 |
15 | 625a67cb |
hex | 3eb840f1 |
1052262641 has 2 divisors, whose sum is σ = 1052262642. Its totient is φ = 1052262640.
The previous prime is 1052262623. The next prime is 1052262643. The reversal of 1052262641 is 1462622501.
1052262641 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., 1011494416 + 40768225 = 31804^2 + 6385^2 .
It is a cyclic number.
It is not a de Polignac number, because 1052262641 - 26 = 1052262577 is a prime.
It is a super-2 number, since 2×10522626412 = 2214513331288589762, which contains 22 as substring.
Together with 1052262643, 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 (1052262643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526131320 + 526131321.
It is an arithmetic number, because the mean of its divisors is an integer number (526131321).
Almost surely, 21052262641 is an apocalyptic number.
It is an amenable number.
1052262641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052262641 is an equidigital number, since it uses as much as digits as its factorization.
1052262641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
The square root of 1052262641 is about 32438.5980122446. The cubic root of 1052262641 is about 1017.1259092414.
The spelling of 1052262641 in words is "one billion, fifty-two million, two hundred sixty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •