Base | Representation |
---|---|
bin | 111110010010100… |
… | …110000111110101 |
3 | 2200211110122201221 |
4 | 332102212013311 |
5 | 4120013442013 |
6 | 251411150341 |
7 | 34616611243 |
oct | 7622460765 |
9 | 2624418657 |
10 | 1045062133 |
11 | 496a01715 |
12 | 251ba53b1 |
13 | 138686b7b |
14 | 9cb1b793 |
15 | 61b3308d |
hex | 3e4a61f5 |
1045062133 has 2 divisors, whose sum is σ = 1045062134. Its totient is φ = 1045062132.
The previous prime is 1045062127. The next prime is 1045062163. The reversal of 1045062133 is 3312605401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 565583524 + 479478609 = 23782^2 + 21897^2 .
It is a cyclic number.
It is not a de Polignac number, because 1045062133 - 221 = 1042964981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1045062098 and 1045062107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1045062163) 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, 522531066 + 522531067.
It is an arithmetic number, because the mean of its divisors is an integer number (522531067).
Almost surely, 21045062133 is an apocalyptic number.
It is an amenable number.
1045062133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1045062133 is an equidigital number, since it uses as much as digits as its factorization.
1045062133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 1045062133 is about 32327.4207600916. The cubic root of 1045062133 is about 1014.8005733069.
Adding to 1045062133 its reverse (3312605401), we get a palindrome (4357667534).
The spelling of 1045062133 in words is "one billion, forty-five million, sixty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •