Base | Representation |
---|---|
bin | 10011011100000… |
… | …01010111001001 |
3 | 102100211021002121 |
4 | 21232001113021 |
5 | 313220343040 |
6 | 24102531241 |
7 | 4016660044 |
oct | 1156012711 |
9 | 370737077 |
10 | 163059145 |
11 | 84051827 |
12 | 46736b21 |
13 | 27a22002 |
14 | 17927c5b |
15 | e4adc4a |
hex | 9b815c9 |
163059145 has 4 divisors (see below), whose sum is σ = 195670980. Its totient is φ = 130447312.
The previous prime is 163059131. The next prime is 163059179. The reversal of 163059145 is 541950361.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 541950361 = 17 ⋅31879433.
It can be written as a sum of positive squares in 2 ways, for example, as 51883209 + 111175936 = 7203^2 + 10544^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-163059145 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 163059145.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16305910 + ... + 16305919.
It is an arithmetic number, because the mean of its divisors is an integer number (48917745).
Almost surely, 2163059145 is an apocalyptic number.
It is an amenable number.
163059145 is a deficient number, since it is larger than the sum of its proper divisors (32611835).
163059145 is an equidigital number, since it uses as much as digits as its factorization.
163059145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32611834.
The product of its (nonzero) digits is 16200, while the sum is 34.
The square root of 163059145 is about 12769.4614216889. The cubic root of 163059145 is about 546.3216192508.
The spelling of 163059145 in words is "one hundred sixty-three million, fifty-nine thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •