Base | Representation |
---|---|
bin | 1111011011110000… |
… | …0011100001100101 |
3 | 101200201200001211001 |
4 | 3312330003201211 |
5 | 31441043010323 |
6 | 1523033313301 |
7 | 204444252031 |
oct | 36674034145 |
9 | 11621601731 |
10 | 4142938213 |
11 | 1836642887 |
12 | 977565831 |
13 | 51041a23b |
14 | 2b43211c1 |
15 | 193aac3ad |
hex | f6f03865 |
4142938213 has 4 divisors (see below), whose sum is σ = 4147179660. Its totient is φ = 4138696768.
The previous prime is 4142938147. The next prime is 4142938297. The reversal of 4142938213 is 3128392414.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3843752004 + 299186209 = 61998^2 + 17297^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4142938213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4142938313) 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, 2119258 + ... + 2121211.
It is an arithmetic number, because the mean of its divisors is an integer number (1036794915).
Almost surely, 24142938213 is an apocalyptic number.
It is an amenable number.
4142938213 is a deficient number, since it is larger than the sum of its proper divisors (4241447).
4142938213 is an equidigital number, since it uses as much as digits as its factorization.
4142938213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4241446.
The product of its digits is 41472, while the sum is 37.
The square root of 4142938213 is about 64365.6602001409. The cubic root of 4142938213 is about 1606.0885480846.
The spelling of 4142938213 in words is "four billion, one hundred forty-two million, nine hundred thirty-eight thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •