Base | Representation |
---|---|
bin | 1000110101010111… |
… | …11101100010100101 |
3 | 110020112020002011221 |
4 | 10122223331202211 |
5 | 34203112333143 |
6 | 2102340300341 |
7 | 225346164202 |
oct | 43253754245 |
9 | 13215202157 |
10 | 4742699173 |
11 | 20141480a3 |
12 | b043a16b1 |
13 | 5a7761094 |
14 | 32dc44ca9 |
15 | 1cb57e2ed |
hex | 11aafd8a5 |
4742699173 has 4 divisors (see below), whose sum is σ = 4759577388. Its totient is φ = 4725820960.
The previous prime is 4742699131. The next prime is 4742699177. The reversal of 4742699173 is 3719962474.
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 4159863009 + 582836164 = 64497^2 + 24142^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4742699173 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 4742699173.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4742699177) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8438686 + ... + 8439247.
It is an arithmetic number, because the mean of its divisors is an integer number (1189894347).
Almost surely, 24742699173 is an apocalyptic number.
It is an amenable number.
4742699173 is a deficient number, since it is larger than the sum of its proper divisors (16878215).
4742699173 is a wasteful number, since it uses less digits than its factorization.
4742699173 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16878214.
The product of its digits is 2286144, while the sum is 52.
The square root of 4742699173 is about 68867.2576265383. The cubic root of 4742699173 is about 1680.1260266616.
The spelling of 4742699173 in words is "four billion, seven hundred forty-two million, six hundred ninety-nine thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •