Base | Representation |
---|---|
bin | 1110111101000100… |
… | …0111011001111001 |
3 | 101100202111120222110 |
4 | 3233101013121321 |
5 | 31210121211101 |
6 | 1502155042533 |
7 | 201322326462 |
oct | 35721073171 |
9 | 11322446873 |
10 | 4014241401 |
11 | 177aa30a85 |
12 | 940440449 |
13 | 4bc869991 |
14 | 2a11bdd69 |
15 | 187639cd6 |
hex | ef447679 |
4014241401 has 8 divisors (see below), whose sum is σ = 5353353504. Its totient is φ = 2675645120.
The previous prime is 4014241391. The next prime is 4014241403. The reversal of 4014241401 is 1041424104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4014241401 - 25 = 4014241369 is a prime.
It is a super-2 number, since 2×40142414012 = 32228268051004885602, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4014241403) 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 in 7 ways as a sum of consecutive naturals, for example, 110415 + ... + 142196.
It is an arithmetic number, because the mean of its divisors is an integer number (669169188).
Almost surely, 24014241401 is an apocalyptic number.
It is an amenable number.
4014241401 is a deficient number, since it is larger than the sum of its proper divisors (1339112103).
4014241401 is a wasteful number, since it uses less digits than its factorization.
4014241401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257911.
The product of its (nonzero) digits is 512, while the sum is 21.
The square root of 4014241401 is about 63358.0413286269. The cubic root of 4014241401 is about 1589.2827218414.
Adding to 4014241401 its reverse (1041424104), we get a palindrome (5055665505).
The spelling of 4014241401 in words is "four billion, fourteen million, two hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •