Base | Representation |
---|---|
bin | 1110111101001001… |
… | …0110011000110001 |
3 | 101100210010000202101 |
4 | 3233102112120301 |
5 | 31210212034123 |
6 | 1502210020401 |
7 | 201325144612 |
oct | 35722263061 |
9 | 11323100671 |
10 | 4014564913 |
11 | 1780132047 |
12 | 940577701 |
13 | 4bc950cc8 |
14 | 2a1265c09 |
15 | 1876a0aad |
hex | ef496631 |
4014564913 has 4 divisors (see below), whose sum is σ = 4019666800. Its totient is φ = 4009463028.
The previous prime is 4014564887. The next prime is 4014564947. The reversal of 4014564913 is 3194654104.
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 a cyclic number.
It is not a de Polignac number, because 4014564913 - 25 = 4014564881 is a prime.
It is a super-2 number, since 2×40145649132 = 32233462881381395138, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4014564313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2549763 + ... + 2551336.
It is an arithmetic number, because the mean of its divisors is an integer number (1004916700).
Almost surely, 24014564913 is an apocalyptic number.
It is an amenable number.
4014564913 is a deficient number, since it is larger than the sum of its proper divisors (5101887).
4014564913 is an equidigital number, since it uses as much as digits as its factorization.
4014564913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5101886.
The product of its (nonzero) digits is 51840, while the sum is 37.
The square root of 4014564913 is about 63360.5943232858. The cubic root of 4014564913 is about 1589.3254146916.
The spelling of 4014564913 in words is "four billion, fourteen million, five hundred sixty-four thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •