Base | Representation |
---|---|
bin | 111101111111110… |
… | …101010000110001 |
3 | 2200111012202111222 |
4 | 331333311100301 |
5 | 4112234042114 |
6 | 251113514425 |
7 | 34530034034 |
oct | 7577652061 |
9 | 2614182458 |
10 | 1040143409 |
11 | 494152158 |
12 | 250412a15 |
13 | 137654096 |
14 | 9c1db01b |
15 | 614b098e |
hex | 3dff5431 |
1040143409 has 2 divisors, whose sum is σ = 1040143410. Its totient is φ = 1040143408.
The previous prime is 1040143399. The next prime is 1040143411. The reversal of 1040143409 is 9043410401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 532317184 + 507826225 = 23072^2 + 22535^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1040143409 is a prime.
It is a super-2 number, since 2×10401434092 = 2163796622572282562, which contains 22 as substring.
Together with 1040143411, 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 (1040143439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520071704 + 520071705.
It is an arithmetic number, because the mean of its divisors is an integer number (520071705).
Almost surely, 21040143409 is an apocalyptic number.
It is an amenable number.
1040143409 is a deficient number, since it is larger than the sum of its proper divisors (1).
1040143409 is an equidigital number, since it uses as much as digits as its factorization.
1040143409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 1040143409 is about 32251.2543787060. The cubic root of 1040143409 is about 1013.2059709673.
The spelling of 1040143409 in words is "one billion, forty million, one hundred forty-three thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •