Base | Representation |
---|---|
bin | 1111100000000000… |
… | …0000100111011101 |
3 | 101201222012002212101 |
4 | 3320000000213131 |
5 | 32010123031333 |
6 | 1524511205101 |
7 | 205051544401 |
oct | 37000004735 |
9 | 11658162771 |
10 | 4160752093 |
11 | 18456aa6a3 |
12 | 981516791 |
13 | 5140165b4 |
14 | 2b683b101 |
15 | 19542a67d |
hex | f80009dd |
4160752093 has 8 divisors (see below), whose sum is σ = 4203578808. Its totient is φ = 4118145024.
The previous prime is 4160752081. The next prime is 4160752103. The reversal of 4160752093 is 3902570614.
It can be written as a sum of positive squares in 4 ways, for example, as 2311494084 + 1849258009 = 48078^2 + 43003^2 .
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-4160752093 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 (4160752073) 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, 16696 + ... + 92737.
It is an arithmetic number, because the mean of its divisors is an integer number (525447351).
Almost surely, 24160752093 is an apocalyptic number.
It is an amenable number.
4160752093 is a deficient number, since it is larger than the sum of its proper divisors (42826715).
4160752093 is a wasteful number, since it uses less digits than its factorization.
4160752093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109823.
The product of its (nonzero) digits is 45360, while the sum is 37.
The square root of 4160752093 is about 64503.8920763701. The cubic root of 4160752093 is about 1608.3872193805.
The spelling of 4160752093 in words is "four billion, one hundred sixty million, seven hundred fifty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •