Base | Representation |
---|---|
bin | 111110000111100… |
… | …001101011000001 |
3 | 2200122000020012102 |
4 | 332013201223001 |
5 | 4113243112241 |
6 | 251225040145 |
7 | 34553134166 |
oct | 7607415301 |
9 | 2618006172 |
10 | 1042160321 |
11 | 4952aa524 |
12 | 251026055 |
13 | 137bac117 |
14 | 9c5a406d |
15 | 6175d39b |
hex | 3e1e1ac1 |
1042160321 has 2 divisors, whose sum is σ = 1042160322. Its totient is φ = 1042160320.
The previous prime is 1042160309. The next prime is 1042160347. The reversal of 1042160321 is 1230612401.
1042160321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 616975921 + 425184400 = 24839^2 + 20620^2 .
It is a cyclic number.
It is not a de Polignac number, because 1042160321 - 26 = 1042160257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1042160293 and 1042160302.
It is not a weakly prime, because it can be changed into another prime (1042160351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521080160 + 521080161.
It is an arithmetic number, because the mean of its divisors is an integer number (521080161).
Almost surely, 21042160321 is an apocalyptic number.
It is an amenable number.
1042160321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042160321 is an equidigital number, since it uses as much as digits as its factorization.
1042160321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 1042160321 is about 32282.5079725848. The cubic root of 1042160321 is about 1013.8604409258.
Adding to 1042160321 its reverse (1230612401), we get a palindrome (2272772722).
The spelling of 1042160321 in words is "one billion, forty-two million, one hundred sixty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •