Base | Representation |
---|---|
bin | 1111011001001111… |
… | …1001001010111001 |
3 | 101122222212011212202 |
4 | 3312103321022321 |
5 | 31430344110131 |
6 | 1522015515545 |
7 | 204255622454 |
oct | 36623711271 |
9 | 11588764782 |
10 | 4132410041 |
11 | 1830701911 |
12 | 973b28bb5 |
13 | 50b1a2156 |
14 | 2b2b8049b |
15 | 192bccbcb |
hex | f64f92b9 |
4132410041 has 2 divisors, whose sum is σ = 4132410042. Its totient is φ = 4132410040.
The previous prime is 4132410017. The next prime is 4132410109. The reversal of 4132410041 is 1400142314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4073120041 + 59290000 = 63821^2 + 7700^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4132410041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4132409995 and 4132410022.
It is not a weakly prime, because it can be changed into another prime (4132410001) 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, 2066205020 + 2066205021.
It is an arithmetic number, because the mean of its divisors is an integer number (2066205021).
Almost surely, 24132410041 is an apocalyptic number.
It is an amenable number.
4132410041 is a deficient number, since it is larger than the sum of its proper divisors (1).
4132410041 is an equidigital number, since it uses as much as digits as its factorization.
4132410041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 4132410041 is about 64283.8241006243. The cubic root of 4132410041 is about 1604.7269121912.
Adding to 4132410041 its reverse (1400142314), we get a palindrome (5532552355).
The spelling of 4132410041 in words is "four billion, one hundred thirty-two million, four hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •