Base | Representation |
---|---|
bin | 1110111010101000… |
… | …1111000100010101 |
3 | 101100001022202212112 |
4 | 3232222033010111 |
5 | 31200014033143 |
6 | 1501152400405 |
7 | 201136566515 |
oct | 35652170425 |
9 | 11301282775 |
10 | 4004049173 |
11 | 17751aa453 |
12 | 938b46105 |
13 | 4ba70b787 |
14 | 29dac9845 |
15 | 1867c4e18 |
hex | eea8f115 |
4004049173 has 2 divisors, whose sum is σ = 4004049174. Its totient is φ = 4004049172.
The previous prime is 4004049167. The next prime is 4004049233. The reversal of 4004049173 is 3719404004.
It is a happy number.
4004049173 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2319192964 + 1684856209 = 48158^2 + 41047^2 .
It is a cyclic number.
It is not a de Polignac number, because 4004049173 - 24 = 4004049157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4004009173) 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 as a sum of consecutive naturals, namely, 2002024586 + 2002024587.
It is an arithmetic number, because the mean of its divisors is an integer number (2002024587).
Almost surely, 24004049173 is an apocalyptic number.
It is an amenable number.
4004049173 is a deficient number, since it is larger than the sum of its proper divisors (1).
4004049173 is an equidigital number, since it uses as much as digits as its factorization.
4004049173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 32.
The square root of 4004049173 is about 63277.5566295033. The cubic root of 4004049173 is about 1587.9365097854.
The spelling of 4004049173 in words is "four billion, four million, forty-nine thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •