Base | Representation |
---|---|
bin | 1111010010010000… |
… | …1111010001110101 |
3 | 101120221210010120112 |
4 | 3310210033101311 |
5 | 31400400443334 |
6 | 1515052312405 |
7 | 203452055441 |
oct | 36444172165 |
9 | 11527703515 |
10 | 4103140469 |
11 | 181613018a |
12 | 966172705 |
13 | 5050c478c |
14 | 2acd21821 |
15 | 19034a4ce |
hex | f490f475 |
4103140469 has 2 divisors, whose sum is σ = 4103140470. Its totient is φ = 4103140468.
The previous prime is 4103140463. The next prime is 4103140507. The reversal of 4103140469 is 9640413014.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3376191025 + 726949444 = 58105^2 + 26962^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4103140469 is a prime.
It is a super-2 number, since 2×41031404692 = 33671523416691079922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4103140463) 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, 2051570234 + 2051570235.
It is an arithmetic number, because the mean of its divisors is an integer number (2051570235).
Almost surely, 24103140469 is an apocalyptic number.
It is an amenable number.
4103140469 is a deficient number, since it is larger than the sum of its proper divisors (1).
4103140469 is an equidigital number, since it uses as much as digits as its factorization.
4103140469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 4103140469 is about 64055.7606230696. The cubic root of 4103140469 is about 1600.9292088201.
The spelling of 4103140469 in words is "four billion, one hundred three million, one hundred forty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •