Base | Representation |
---|---|
bin | 1001000111101100… |
… | …00000110111010101 |
3 | 110122020022021220221 |
4 | 10203312000313111 |
5 | 40011430013143 |
6 | 2125505154341 |
7 | 232223053111 |
oct | 44366006725 |
9 | 13566267827 |
10 | 4896329173 |
11 | 209293963a |
12 | b4792b9b1 |
13 | 6005312c8 |
14 | 3463d6741 |
15 | 1d9cc92ed |
hex | 123d80dd5 |
4896329173 has 8 divisors (see below), whose sum is σ = 5102144280. Its totient is φ = 4692979200.
The previous prime is 4896329147. The next prime is 4896329189. The reversal of 4896329173 is 3719236984.
It can be written as a sum of positive squares in 4 ways, for example, as 722910769 + 4173418404 = 26887^2 + 64602^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4896329173 - 213 = 4896320981 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4896329173.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4896321173) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 612228 + ... + 620173.
It is an arithmetic number, because the mean of its divisors is an integer number (637768035).
Almost surely, 24896329173 is an apocalyptic number.
It is an amenable number.
4896329173 is a deficient number, since it is larger than the sum of its proper divisors (205815107).
4896329173 is a wasteful number, since it uses less digits than its factorization.
4896329173 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1232567.
The product of its digits is 1959552, while the sum is 52.
The square root of 4896329173 is about 69973.7748945989. The cubic root of 4896329173 is about 1698.0750036352.
The spelling of 4896329173 in words is "four billion, eight hundred ninety-six million, three hundred twenty-nine thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •