Base | Representation |
---|---|
bin | 111110101011000… |
… | …111101111110101 |
3 | 2201021120021220212 |
4 | 332223013233311 |
5 | 4123140210232 |
6 | 252201035205 |
7 | 35025346232 |
oct | 7653075765 |
9 | 2637507825 |
10 | 1051491317 |
11 | 49a5a2a98 |
12 | 254185b05 |
13 | 139ac8316 |
14 | 9d912789 |
15 | 624a2eb2 |
hex | 3eac7bf5 |
1051491317 has 2 divisors, whose sum is σ = 1051491318. Its totient is φ = 1051491316.
The previous prime is 1051491313. The next prime is 1051491319. The reversal of 1051491317 is 7131941501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 565773796 + 485717521 = 23786^2 + 22039^2 .
It is an emirp because it is prime and its reverse (7131941501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1051491317 - 22 = 1051491313 is a prime.
It is a super-2 number, since 2×10514913172 = 2211267979452788978, which contains 22 as substring.
Together with 1051491319, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1051491313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525745658 + 525745659.
It is an arithmetic number, because the mean of its divisors is an integer number (525745659).
Almost surely, 21051491317 is an apocalyptic number.
It is an amenable number.
1051491317 is a deficient number, since it is larger than the sum of its proper divisors (1).
1051491317 is an equidigital number, since it uses as much as digits as its factorization.
1051491317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 32.
The square root of 1051491317 is about 32426.7068479055. The cubic root of 1051491317 is about 1016.8773257402.
The spelling of 1051491317 in words is "one billion, fifty-one million, four hundred ninety-one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •