Base | Representation |
---|---|
bin | 1111010010011110… |
… | …1000110010110001 |
3 | 101121000110101201022 |
4 | 3310213220302301 |
5 | 31401113001114 |
6 | 1515123345225 |
7 | 203462456102 |
oct | 36447506261 |
9 | 11530411638 |
10 | 4104031409 |
11 | 18166895a5 |
12 | 966522215 |
13 | 50534716a |
14 | 2ad0b43a9 |
15 | 19047448e |
hex | f49e8cb1 |
4104031409 has 2 divisors, whose sum is σ = 4104031410. Its totient is φ = 4104031408.
The previous prime is 4104031397. The next prime is 4104031411. The reversal of 4104031409 is 9041304014.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4037967025 + 66064384 = 63545^2 + 8128^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4104031409 is a prime.
It is a super-3 number, since 3×41040314093 (a number of 30 digits) contains 333 as substring.
Together with 4104031411, 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 (4104031429) 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, 2052015704 + 2052015705.
It is an arithmetic number, because the mean of its divisors is an integer number (2052015705).
Almost surely, 24104031409 is an apocalyptic number.
It is an amenable number.
4104031409 is a deficient number, since it is larger than the sum of its proper divisors (1).
4104031409 is an equidigital number, since it uses as much as digits as its factorization.
4104031409 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 4104031409 is about 64062.7146552501. The cubic root of 4104031409 is about 1601.0450736198.
The spelling of 4104031409 in words is "four billion, one hundred four million, thirty-one thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •