Base | Representation |
---|---|
bin | 1111010010010100… |
… | …1110101001101001 |
3 | 101120222021022122022 |
4 | 3310211032221221 |
5 | 31400432300131 |
6 | 1515102034225 |
7 | 203454216266 |
oct | 36445165151 |
9 | 11528238568 |
10 | 4103400041 |
11 | 1816298204 |
12 | 966278975 |
13 | 505185980 |
14 | 2acd8c26d |
15 | 19039c37b |
hex | f494ea69 |
4103400041 has 16 divisors (see below), whose sum is σ = 4683659904. Its totient is φ = 3561387264.
The previous prime is 4103400019. The next prime is 4103400043. The reversal of 4103400041 is 1400043014.
It is a cyclic number.
It is not a de Polignac number, because 4103400041 - 26 = 4103399977 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4103399992 and 4103400019.
It is not an unprimeable number, because it can be changed into a prime (4103400043) 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 in 15 ways as a sum of consecutive naturals, for example, 226190 + ... + 243656.
It is an arithmetic number, because the mean of its divisors is an integer number (292728744).
Almost surely, 24103400041 is an apocalyptic number.
It is an amenable number.
4103400041 is a deficient number, since it is larger than the sum of its proper divisors (580259863).
4103400041 is a wasteful number, since it uses less digits than its factorization.
4103400041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18560.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 4103400041 is about 64057.7867319813. The cubic root of 4103400041 is about 1600.9629673226.
Adding to 4103400041 its reverse (1400043014), we get a palindrome (5503443055).
The spelling of 4103400041 in words is "four billion, one hundred three million, four hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •