Base | Representation |
---|---|
bin | 1111011011010100… |
… | …1011000011001111 |
3 | 101200121021101221111 |
4 | 3312311023003033 |
5 | 31440112242111 |
6 | 1522530512451 |
7 | 204423026026 |
oct | 36665130317 |
9 | 11617241844 |
10 | 4141134031 |
11 | 1835620321 |
12 | 976a35727 |
13 | 50cc37c88 |
14 | 2b3db18bd |
15 | 193852a21 |
hex | f6d4b0cf |
4141134031 has 2 divisors, whose sum is σ = 4141134032. Its totient is φ = 4141134030.
The previous prime is 4141134007. The next prime is 4141134047. The reversal of 4141134031 is 1304311414.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4141134031 - 29 = 4141133519 is a prime.
It is a super-2 number, since 2×41411340312 = 34297982125412617922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4141133993 and 4141134011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4141134071) 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, 2070567015 + 2070567016.
It is an arithmetic number, because the mean of its divisors is an integer number (2070567016).
Almost surely, 24141134031 is an apocalyptic number.
4141134031 is a deficient number, since it is larger than the sum of its proper divisors (1).
4141134031 is an equidigital number, since it uses as much as digits as its factorization.
4141134031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 4141134031 is about 64351.6435765241. The cubic root of 4141134031 is about 1605.8553724468.
Adding to 4141134031 its reverse (1304311414), we get a palindrome (5445445445).
The spelling of 4141134031 in words is "four billion, one hundred forty-one million, one hundred thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •