Base | Representation |
---|---|
bin | 1111011011010011… |
… | …1001001101101001 |
3 | 101200121010200201111 |
4 | 3312310321031221 |
5 | 31440102422334 |
6 | 1522525150321 |
7 | 204422303023 |
oct | 36664711551 |
9 | 11617120644 |
10 | 4141060969 |
11 | 1835580441 |
12 | 9769bb3a1 |
13 | 50cc10946 |
14 | 2b3d93013 |
15 | 19383b064 |
hex | f6d39369 |
4141060969 has 2 divisors, whose sum is σ = 4141060970. Its totient is φ = 4141060968.
The previous prime is 4141060919. The next prime is 4141060981. The reversal of 4141060969 is 9690601414.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3432436569 + 708624400 = 58587^2 + 26620^2 .
It is a cyclic number.
It is not a de Polignac number, because 4141060969 - 27 = 4141060841 is a prime.
It is a super-2 number, since 2×41410609692 = 34296771897950437922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4141060919) 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, 2070530484 + 2070530485.
It is an arithmetic number, because the mean of its divisors is an integer number (2070530485).
Almost surely, 24141060969 is an apocalyptic number.
It is an amenable number.
4141060969 is a deficient number, since it is larger than the sum of its proper divisors (1).
4141060969 is an equidigital number, since it uses as much as digits as its factorization.
4141060969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 40.
The square root of 4141060969 is about 64351.0758962117. The cubic root of 4141060969 is about 1605.8459283594.
The spelling of 4141060969 in words is "four billion, one hundred forty-one million, sixty thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •