Base | Representation |
---|---|
bin | 100000000000100… |
… | …0100110000010001 |
3 | 2202211222001011222 |
4 | 1000001010300101 |
5 | 4144422222231 |
6 | 254324014425 |
7 | 35421022451 |
oct | 10001046021 |
9 | 2684861158 |
10 | 1074023441 |
11 | 501292787 |
12 | 25b831415 |
13 | 14168713a |
14 | a28d9d61 |
15 | 6445427b |
hex | 40044c11 |
1074023441 has 2 divisors, whose sum is σ = 1074023442. Its totient is φ = 1074023440.
The previous prime is 1074023417. The next prime is 1074023443. The reversal of 1074023441 is 1443204701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1044647041 + 29376400 = 32321^2 + 5420^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1074023441 is a prime.
Together with 1074023443, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1074023441.
It is not a weakly prime, because it can be changed into another prime (1074023443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 537011720 + 537011721.
It is an arithmetic number, because the mean of its divisors is an integer number (537011721).
Almost surely, 21074023441 is an apocalyptic number.
It is an amenable number.
1074023441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1074023441 is an equidigital number, since it uses as much as digits as its factorization.
1074023441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 26.
The square root of 1074023441 is about 32772.2968526773. The cubic root of 1074023441 is about 1024.0895158078.
The spelling of 1074023441 in words is "one billion, seventy-four million, twenty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •