Base | Representation |
---|---|
bin | 1111011010110101… |
… | …1010100101000001 |
3 | 101200110110002102211 |
4 | 3312231122211001 |
5 | 31434102203411 |
6 | 1522415142121 |
7 | 204366526225 |
oct | 36655324501 |
9 | 11613402384 |
10 | 4139100481 |
11 | 18344614aa |
12 | 976214941 |
13 | 50c6a54a9 |
14 | 2b3a02785 |
15 | 1935a0221 |
hex | f6b5a941 |
4139100481 has 2 divisors, whose sum is σ = 4139100482. Its totient is φ = 4139100480.
The previous prime is 4139100457. The next prime is 4139100577. The reversal of 4139100481 is 1840019314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2167740481 + 1971360000 = 46559^2 + 44400^2 .
It is a cyclic number.
It is not a de Polignac number, because 4139100481 - 29 = 4139099969 is a prime.
It is a super-2 number, since 2×41391004812 = 34264305583628862722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4139100421) 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, 2069550240 + 2069550241.
It is an arithmetic number, because the mean of its divisors is an integer number (2069550241).
Almost surely, 24139100481 is an apocalyptic number.
It is an amenable number.
4139100481 is a deficient number, since it is larger than the sum of its proper divisors (1).
4139100481 is an equidigital number, since it uses as much as digits as its factorization.
4139100481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 31.
The square root of 4139100481 is about 64335.8413405778. The cubic root of 4139100481 is about 1605.5924716851.
Adding to 4139100481 its reverse (1840019314), we get a palindrome (5979119795).
The spelling of 4139100481 in words is "four billion, one hundred thirty-nine million, one hundred thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •