Base | Representation |
---|---|
bin | 1110111001110100… |
… | …1111011000001101 |
3 | 101022210220200220011 |
4 | 3232131033120031 |
5 | 31143131030243 |
6 | 1500551353221 |
7 | 201065620654 |
oct | 35635173015 |
9 | 11283820804 |
10 | 4000642573 |
11 | 1773292a84 |
12 | 937982811 |
13 | 4b9ab8035 |
14 | 29d48019b |
15 | 18635089d |
hex | ee74f60d |
4000642573 has 4 divisors (see below), whose sum is σ = 4003058620. Its totient is φ = 3998226528.
The previous prime is 4000642549. The next prime is 4000642577. The reversal of 4000642573 is 3752460004.
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 1500942564 + 2499700009 = 38742^2 + 49997^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4000642573 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 (4000642577) 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 3 ways as a sum of consecutive naturals, for example, 1205538 + ... + 1208851.
It is an arithmetic number, because the mean of its divisors is an integer number (1000764655).
Almost surely, 24000642573 is an apocalyptic number.
It is an amenable number.
4000642573 is a deficient number, since it is larger than the sum of its proper divisors (2416047).
4000642573 is a wasteful number, since it uses less digits than its factorization.
4000642573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2416046.
The product of its (nonzero) digits is 20160, while the sum is 31.
The square root of 4000642573 is about 63250.6329849749. The cubic root of 4000642573 is about 1587.4860491716.
The spelling of 4000642573 in words is "four billion, six hundred forty-two thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •