Base | Representation |
---|---|
bin | 111110101010110… |
… | …100011001010101 |
3 | 2201021102021012011 |
4 | 332222310121111 |
5 | 4123130141203 |
6 | 252155224221 |
7 | 35024566156 |
oct | 7652643125 |
9 | 2637367164 |
10 | 1051412053 |
11 | 49a54948a |
12 | 254148071 |
13 | 139a9b213 |
14 | 9d8d192d |
15 | 6248976d |
hex | 3eab4655 |
1051412053 has 2 divisors, whose sum is σ = 1051412054. Its totient is φ = 1051412052.
The previous prime is 1051412009. The next prime is 1051412069. The reversal of 1051412053 is 3502141501.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 889053489 + 162358564 = 29817^2 + 12742^2 .
It is a cyclic number.
It is not a de Polignac number, because 1051412053 - 29 = 1051411541 is a prime.
It is a super-2 number, since 2×10514120532 = 2210934610387349618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1051412353) 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, 525706026 + 525706027.
It is an arithmetic number, because the mean of its divisors is an integer number (525706027).
Almost surely, 21051412053 is an apocalyptic number.
It is an amenable number.
1051412053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1051412053 is an equidigital number, since it uses as much as digits as its factorization.
1051412053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 1051412053 is about 32425.4846224386. The cubic root of 1051412053 is about 1016.8517735273.
Adding to 1051412053 its reverse (3502141501), we get a palindrome (4553553554).
The spelling of 1051412053 in words is "one billion, fifty-one million, four hundred twelve thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •