Base | Representation |
---|---|
bin | 1111011101101100… |
… | …1111100101100001 |
3 | 101201022001102222222 |
4 | 3313123033211201 |
5 | 32000141122311 |
6 | 1523524440425 |
7 | 204603613262 |
oct | 36733174541 |
9 | 11638042888 |
10 | 4151114081 |
11 | 18402174a4 |
12 | 97a249115 |
13 | 51202072a |
14 | 2b544c969 |
15 | 194674adb |
hex | f76cf961 |
4151114081 has 2 divisors, whose sum is σ = 4151114082. Its totient is φ = 4151114080.
The previous prime is 4151114057. The next prime is 4151114087. The reversal of 4151114081 is 1804111514.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4119585856 + 31528225 = 64184^2 + 5615^2 .
It is a cyclic number.
It is not a de Polignac number, because 4151114081 - 26 = 4151114017 is a prime.
It is a super-2 number, since 2×41511140812 = 34463496226952949122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4151114081.
It is not a weakly prime, because it can be changed into another prime (4151114087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2075557040 + 2075557041.
It is an arithmetic number, because the mean of its divisors is an integer number (2075557041).
Almost surely, 24151114081 is an apocalyptic number.
It is an amenable number.
4151114081 is a deficient number, since it is larger than the sum of its proper divisors (1).
4151114081 is an equidigital number, since it uses as much as digits as its factorization.
4151114081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 640, while the sum is 26.
The square root of 4151114081 is about 64429.1399989166. The cubic root of 4151114081 is about 1607.1443639381.
Adding to 4151114081 its reverse (1804111514), we get a palindrome (5955225595).
The spelling of 4151114081 in words is "four billion, one hundred fifty-one million, one hundred fourteen thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •