Base | Representation |
---|---|
bin | 1111010100110110… |
… | …1011010010001001 |
3 | 101121201020000021111 |
4 | 3311031223102021 |
5 | 31411141044311 |
6 | 1520121210321 |
7 | 203643310036 |
oct | 36515532211 |
9 | 11551200244 |
10 | 4114003081 |
11 | 182127a451 |
12 | 9699309a1 |
13 | 507428b66 |
14 | 2b054c38d |
15 | 191293d21 |
hex | f536b489 |
4114003081 has 2 divisors, whose sum is σ = 4114003082. Its totient is φ = 4114003080.
The previous prime is 4114003067. The next prime is 4114003141. The reversal of 4114003081 is 1803004114.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2205711225 + 1908291856 = 46965^2 + 43684^2 .
It is a cyclic number.
It is not a de Polignac number, because 4114003081 - 215 = 4113970313 is a prime.
It is a super-2 number, since 2×41140030812 = 33850042700954985122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4114003051) 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, 2057001540 + 2057001541.
It is an arithmetic number, because the mean of its divisors is an integer number (2057001541).
Almost surely, 24114003081 is an apocalyptic number.
It is an amenable number.
4114003081 is a deficient number, since it is larger than the sum of its proper divisors (1).
4114003081 is an equidigital number, since it uses as much as digits as its factorization.
4114003081 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 22.
The square root of 4114003081 is about 64140.4948608911. The cubic root of 4114003081 is about 1602.3407251306.
Adding to 4114003081 its reverse (1803004114), we get a palindrome (5917007195).
The spelling of 4114003081 in words is "four billion, one hundred fourteen million, three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •