Base | Representation |
---|---|
bin | 1000011100010110… |
… | …00100100001001101 |
3 | 102200220011120121221 |
4 | 10032023010201031 |
5 | 33240341003123 |
6 | 2025440323341 |
7 | 220216512532 |
oct | 41613044115 |
9 | 12626146557 |
10 | 4532750413 |
11 | 1a1668a524 |
12 | a66013551 |
13 | 573102649 |
14 | 30ddd2d89 |
15 | 1b7e0c25d |
hex | 10e2c484d |
4532750413 has 4 divisors (see below), whose sum is σ = 4551558748. Its totient is φ = 4513942080.
The previous prime is 4532750401. The next prime is 4532750419. The reversal of 4532750413 is 3140572354.
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 1915200169 + 2617550244 = 43763^2 + 51162^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4532750413 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 (4532750419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9403806 + ... + 9404287.
It is an arithmetic number, because the mean of its divisors is an integer number (1137889687).
Almost surely, 24532750413 is an apocalyptic number.
It is an amenable number.
4532750413 is a deficient number, since it is larger than the sum of its proper divisors (18808335).
4532750413 is a wasteful number, since it uses less digits than its factorization.
4532750413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18808334.
The product of its (nonzero) digits is 50400, while the sum is 34.
The square root of 4532750413 is about 67325.7039547304. The cubic root of 4532750413 is about 1654.9591131516.
The spelling of 4532750413 in words is "four billion, five hundred thirty-two million, seven hundred fifty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •