Base | Representation |
---|---|
bin | 111110001001000… |
… | …000111000110001 |
3 | 2200122202001011212 |
4 | 332021000320301 |
5 | 4113343102241 |
6 | 251241245505 |
7 | 34556350211 |
oct | 7611007061 |
9 | 2618661155 |
10 | 1042550321 |
11 | 49554653a |
12 | 251193895 |
13 | 137cb77a7 |
14 | 9c666241 |
15 | 617d8beb |
hex | 3e240e31 |
1042550321 has 2 divisors, whose sum is σ = 1042550322. Its totient is φ = 1042550320.
The previous prime is 1042550309. The next prime is 1042550323. The reversal of 1042550321 is 1230552401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1001089600 + 41460721 = 31640^2 + 6439^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1042550321 is a prime.
It is a super-2 number, since 2×10425503212 = 2173822343634406082, which contains 22 as substring.
Together with 1042550323, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1042550323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521275160 + 521275161.
It is an arithmetic number, because the mean of its divisors is an integer number (521275161).
Almost surely, 21042550321 is an apocalyptic number.
It is an amenable number.
1042550321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042550321 is an equidigital number, since it uses as much as digits as its factorization.
1042550321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 1042550321 is about 32288.5478304615. The cubic root of 1042550321 is about 1013.9868950011.
The spelling of 1042550321 in words is "one billion, forty-two million, five hundred fifty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •