Base | Representation |
---|---|
bin | 1111000110000111… |
… | …0010100000010001 |
3 | 101110101212101200011 |
4 | 3301201302200101 |
5 | 31244323313143 |
6 | 1510031554521 |
7 | 202262564002 |
oct | 36141624021 |
9 | 11411771604 |
10 | 4052166673 |
11 | 179a384885 |
12 | 95108ba41 |
13 | 4c7688079 |
14 | 2a62531a9 |
15 | 18ab2be9d |
hex | f1872811 |
4052166673 has 8 divisors (see below), whose sum is σ = 4072658688. Its totient is φ = 4031695824.
The previous prime is 4052166649. The next prime is 4052166697. The reversal of 4052166673 is 3766612504.
It is an interprime number because it is at equal distance from previous prime (4052166649) and next prime (4052166697).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4052166673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4052166623) 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 7 ways as a sum of consecutive naturals, for example, 494790 + ... + 502912.
It is an arithmetic number, because the mean of its divisors is an integer number (509082336).
Almost surely, 24052166673 is an apocalyptic number.
It is an amenable number.
4052166673 is a deficient number, since it is larger than the sum of its proper divisors (20492015).
4052166673 is a wasteful number, since it uses less digits than its factorization.
4052166673 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10583.
The product of its (nonzero) digits is 181440, while the sum is 40.
The square root of 4052166673 is about 63656.6310214419. The cubic root of 4052166673 is about 1594.2720541648.
The spelling of 4052166673 in words is "four billion, fifty-two million, one hundred sixty-six thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •