Base | Representation |
---|---|
bin | 111110110001111… |
… | …011001001001001 |
3 | 2201101220220020222 |
4 | 332301323021021 |
5 | 4124114242242 |
6 | 252303155425 |
7 | 35046454466 |
oct | 7661731111 |
9 | 2641826228 |
10 | 1053274697 |
11 | 4a0600962 |
12 | 2548a5b75 |
13 | 13a2a0c87 |
14 | 9dc5866d |
15 | 627065d2 |
hex | 3ec7b249 |
1053274697 has 2 divisors, whose sum is σ = 1053274698. Its totient is φ = 1053274696.
The previous prime is 1053274619. The next prime is 1053274699. The reversal of 1053274697 is 7964723501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 756195001 + 297079696 = 27499^2 + 17236^2 .
It is a cyclic number.
It is not a de Polignac number, because 1053274697 - 214 = 1053258313 is a prime.
It is a super-2 number, since 2×10532746972 = 2218775174680883618, which contains 22 as substring.
Together with 1053274699, 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 (1053274699) 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, 526637348 + 526637349.
It is an arithmetic number, because the mean of its divisors is an integer number (526637349).
Almost surely, 21053274697 is an apocalyptic number.
It is an amenable number.
1053274697 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053274697 is an equidigital number, since it uses as much as digits as its factorization.
1053274697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 317520, while the sum is 44.
The square root of 1053274697 is about 32454.1938276088. The cubic root of 1053274697 is about 1017.4518920321.
The spelling of 1053274697 in words is "one billion, fifty-three million, two hundred seventy-four thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •