Base | Representation |
---|---|
bin | 111110010011001… |
… | …010101101010101 |
3 | 2200211202021022011 |
4 | 332103022231111 |
5 | 4120033240424 |
6 | 251414304221 |
7 | 34621104163 |
oct | 7623125525 |
9 | 2624667264 |
10 | 1045211989 |
11 | 496aa4268 |
12 | 252058071 |
13 | 13870a143 |
14 | 9cb5a233 |
15 | 61b62694 |
hex | 3e4cab55 |
1045211989 has 2 divisors, whose sum is σ = 1045211990. Its totient is φ = 1045211988.
The previous prime is 1045211987. The next prime is 1045212011. The reversal of 1045211989 is 9891125401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 981882225 + 63329764 = 31335^2 + 7958^2 .
It is a cyclic number.
It is not a de Polignac number, because 1045211989 - 21 = 1045211987 is a prime.
It is a super-2 number, since 2×10452119892 = 2184936203898672242, which contains 22 as substring.
Together with 1045211987, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1045211987) 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, 522605994 + 522605995.
It is an arithmetic number, because the mean of its divisors is an integer number (522605995).
Almost surely, 21045211989 is an apocalyptic number.
It is an amenable number.
1045211989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1045211989 is an equidigital number, since it uses as much as digits as its factorization.
1045211989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 40.
The square root of 1045211989 is about 32329.7384616702. The cubic root of 1045211989 is about 1014.8490765431.
The spelling of 1045211989 in words is "one billion, forty-five million, two hundred eleven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •