Base | Representation |
---|---|
bin | 110101110010101110000011… |
… | …0110010111111110001000101 |
3 | 2022001100000102002211121002110 |
4 | 1223211130012302333301011 |
5 | 444004303403142130432 |
6 | 4354200234332531233 |
7 | 201443645315660412 |
oct | 15345340662776105 |
9 | 2261300362747073 |
10 | 473163776130117 |
11 | 1278456a32a9046 |
12 | 4509a387320b19 |
13 | 174031ca44b987 |
14 | 84bb36b1d7109 |
15 | 39a81205a8dcc |
hex | 1ae5706cbfc45 |
473163776130117 has 8 divisors (see below), whose sum is σ = 638870921357440. Its totient is φ = 311449574161440.
The previous prime is 473163776129951. The next prime is 473163776130161. The reversal of 473163776130117 is 711031677361374.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 473163776130117 - 28 = 473163776129861 is a prime.
It is a super-2 number, since 2×4731637761301172 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (473163776130917) 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, 998235814384 + ... + 998235814857.
It is an arithmetic number, because the mean of its divisors is an integer number (79858865169680).
Almost surely, 2473163776130117 is an apocalyptic number.
It is an amenable number.
473163776130117 is a deficient number, since it is larger than the sum of its proper divisors (165707145227323).
473163776130117 is a wasteful number, since it uses less digits than its factorization.
473163776130117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1996471629323.
The product of its (nonzero) digits is 9335088, while the sum is 57.
The spelling of 473163776130117 in words is "four hundred seventy-three trillion, one hundred sixty-three billion, seven hundred seventy-six million, one hundred thirty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •