Base | Representation |
---|---|
bin | 111110110001010… |
… | …010110100001001 |
3 | 2201101121111200001 |
4 | 332301102310021 |
5 | 4124044001023 |
6 | 252255443001 |
7 | 35045166061 |
oct | 7661226411 |
9 | 2641544601 |
10 | 1053109513 |
11 | 4a04a8845 |
12 | 254826461 |
13 | 13a243a31 |
14 | 9dc143a1 |
15 | 626c26ad |
hex | 3ec52d09 |
1053109513 has 2 divisors, whose sum is σ = 1053109514. Its totient is φ = 1053109512.
The previous prime is 1053109511. The next prime is 1053109529. The reversal of 1053109513 is 3159013501.
1053109513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 663165504 + 389944009 = 25752^2 + 19747^2 .
It is a cyclic number.
It is not a de Polignac number, because 1053109513 - 21 = 1053109511 is a prime.
It is a super-2 number, since 2×10531095132 = 2218079292742194338, which contains 22 as substring.
Together with 1053109511, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1053109511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526554756 + 526554757.
It is an arithmetic number, because the mean of its divisors is an integer number (526554757).
Almost surely, 21053109513 is an apocalyptic number.
It is an amenable number.
1053109513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053109513 is an equidigital number, since it uses as much as digits as its factorization.
1053109513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2025, while the sum is 28.
The square root of 1053109513 is about 32451.6488487103. The cubic root of 1053109513 is about 1017.3987006027.
The spelling of 1053109513 in words is "one billion, fifty-three million, one hundred nine thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •