Base | Representation |
---|---|
bin | 10011011011100… |
… | …10111011101111 |
3 | 102100201021000210 |
4 | 21231302323233 |
5 | 313212000142 |
6 | 24101353503 |
7 | 4016322540 |
oct | 1155627357 |
9 | 370637023 |
10 | 163000047 |
11 | 84011391 |
12 | 46708893 |
13 | 27a01142 |
14 | 179104c7 |
15 | e49b49c |
hex | 9b72eef |
163000047 has 8 divisors (see below), whose sum is σ = 248381056. Its totient is φ = 93142872.
The previous prime is 163000037. The next prime is 163000073. The reversal of 163000047 is 740000361.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 163000047 - 211 = 162997999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 7761907 = 163000047 / (1 + 6 + 3 + 0 + 0 + 0 + 0 + 4 + 7).
It is a junction number, because it is equal to n+sod(n) for n = 162999987 and 163000032.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163000007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3880933 + ... + 3880974.
It is an arithmetic number, because the mean of its divisors is an integer number (31047632).
Almost surely, 2163000047 is an apocalyptic number.
163000047 is a deficient number, since it is larger than the sum of its proper divisors (85381009).
163000047 is an equidigital number, since it uses as much as digits as its factorization.
163000047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7761917.
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 163000047 is about 12767.1471754656. The cubic root of 163000047 is about 546.2556096312.
The spelling of 163000047 in words is "one hundred sixty-three million, forty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •