Base | Representation |
---|---|
bin | 111110101010001… |
… | …101101010000001 |
3 | 2201021010012112021 |
4 | 332222031222001 |
5 | 4123110102002 |
6 | 252152001441 |
7 | 35023335436 |
oct | 7652155201 |
9 | 2637105467 |
10 | 1051253377 |
11 | 49a450249 |
12 | 254090281 |
13 | 139a43c25 |
14 | 9d88db8d |
15 | 62457737 |
hex | 3ea8da81 |
1051253377 has 2 divisors, whose sum is σ = 1051253378. Its totient is φ = 1051253376.
The previous prime is 1051253353. The next prime is 1051253389. The reversal of 1051253377 is 7733521501.
1051253377 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., 871666576 + 179586801 = 29524^2 + 13401^2 .
It is a cyclic number.
It is not a de Polignac number, because 1051253377 - 215 = 1051220609 is a prime.
It is a super-2 number, since 2×10512533772 = 2210267325307808258, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1051253677) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525626688 + 525626689.
It is an arithmetic number, because the mean of its divisors is an integer number (525626689).
Almost surely, 21051253377 is an apocalyptic number.
It is an amenable number.
1051253377 is a deficient number, since it is larger than the sum of its proper divisors (1).
1051253377 is an equidigital number, since it uses as much as digits as its factorization.
1051253377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22050, while the sum is 34.
The square root of 1051253377 is about 32423.0377509573. The cubic root of 1051253377 is about 1016.8006175322.
Adding to 1051253377 its reverse (7733521501), we get a palindrome (8784774878).
The spelling of 1051253377 in words is "one billion, fifty-one million, two hundred fifty-three thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •