Base | Representation |
---|---|
bin | 1110111101000010… |
… | …1100110000010001 |
3 | 101100202022001020111 |
4 | 3233100230300101 |
5 | 31210104212431 |
6 | 1502152441321 |
7 | 201321363310 |
oct | 35720546021 |
9 | 11322261214 |
10 | 4014132241 |
11 | 177a966a69 |
12 | 9403a9241 |
13 | 4bc82c0a2 |
14 | 2a1192277 |
15 | 1876177b1 |
hex | ef42cc11 |
4014132241 has 4 divisors (see below), whose sum is σ = 4587579712. Its totient is φ = 3440684772.
The previous prime is 4014132233. The next prime is 4014132271. The reversal of 4014132241 is 1422314104.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 4014132241 - 23 = 4014132233 is a prime.
It is a super-2 number, since 2×40141322412 = 32226515296471364162, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4014132271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 286723725 + ... + 286723738.
It is an arithmetic number, because the mean of its divisors is an integer number (1146894928).
Almost surely, 24014132241 is an apocalyptic number.
It is an amenable number.
4014132241 is a deficient number, since it is larger than the sum of its proper divisors (573447471).
4014132241 is an equidigital number, since it uses as much as digits as its factorization.
4014132241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573447470.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 4014132241 is about 63357.1798693723. The cubic root of 4014132241 is about 1589.2683158256.
Adding to 4014132241 its reverse (1422314104), we get a palindrome (5436446345).
The spelling of 4014132241 in words is "four billion, fourteen million, one hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •