Base | Representation |
---|---|
bin | 1110111101000000… |
… | …1111001110110101 |
3 | 101100202001220100211 |
4 | 3233100033032311 |
5 | 31210041330232 |
6 | 1502150105421 |
7 | 201320350621 |
oct | 35720171665 |
9 | 11322056324 |
10 | 4014011317 |
11 | 177a894128 |
12 | 94034b271 |
13 | 4bc7b9034 |
14 | 2a1160181 |
15 | 1875e1a47 |
hex | ef40f3b5 |
4014011317 has 2 divisors, whose sum is σ = 4014011318. Its totient is φ = 4014011316.
The previous prime is 4014011311. The next prime is 4014011357. The reversal of 4014011317 is 7131104104.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2078539281 + 1935472036 = 45591^2 + 43994^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4014011317 is a prime.
It is a super-4 number, since 4×40140113174 (a number of 40 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4014011311) 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, 2007005658 + 2007005659.
It is an arithmetic number, because the mean of its divisors is an integer number (2007005659).
Almost surely, 24014011317 is an apocalyptic number.
It is an amenable number.
4014011317 is a deficient number, since it is larger than the sum of its proper divisors (1).
4014011317 is an equidigital number, since it uses as much as digits as its factorization.
4014011317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
The square root of 4014011317 is about 63356.2255583459. The cubic root of 4014011317 is about 1589.2523569915.
The spelling of 4014011317 in words is "four billion, fourteen million, eleven thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •