Base | Representation |
---|---|
bin | 1110111101000011… |
… | …1110100100111001 |
3 | 101100202102202101012 |
4 | 3233100332210321 |
5 | 31210114031431 |
6 | 1502154203305 |
7 | 201322116164 |
oct | 35720764471 |
9 | 11322382335 |
10 | 4014205241 |
11 | 177aa068a2 |
12 | 940423535 |
13 | 4bc856397 |
14 | 2a11b0adb |
15 | 18762e22b |
hex | ef43e939 |
4014205241 has 2 divisors, whose sum is σ = 4014205242. Its totient is φ = 4014205240.
The previous prime is 4014205229. The next prime is 4014205289. The reversal of 4014205241 is 1425024104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2464129600 + 1550075641 = 49640^2 + 39371^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4014205241 is a prime.
It is a super-2 number, since 2×40142052412 = 32227687433743736162, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4014205141) 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, 2007102620 + 2007102621.
It is an arithmetic number, because the mean of its divisors is an integer number (2007102621).
Almost surely, 24014205241 is an apocalyptic number.
It is an amenable number.
4014205241 is a deficient number, since it is larger than the sum of its proper divisors (1).
4014205241 is an equidigital number, since it uses as much as digits as its factorization.
4014205241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1280, while the sum is 23.
The square root of 4014205241 is about 63357.7559656274. The cubic root of 4014205241 is about 1589.2779497786.
Adding to 4014205241 its reverse (1425024104), we get a palindrome (5439229345).
The spelling of 4014205241 in words is "four billion, fourteen million, two hundred five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •