Base | Representation |
---|---|
bin | 10011011111101… |
… | …11000000111101 |
3 | 102101201202011001 |
4 | 21233313000331 |
5 | 313331303203 |
6 | 24121130301 |
7 | 4024035034 |
oct | 1157670075 |
9 | 371652131 |
10 | 163541053 |
11 | 843508a5 |
12 | 46929991 |
13 | 27b60470 |
14 | 17a1171b |
15 | e55691d |
hex | 9bf703d |
163541053 has 4 divisors (see below), whose sum is σ = 176121148. Its totient is φ = 150960960.
The previous prime is 163541041. The next prime is 163541057. The reversal of 163541053 is 350145361.
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 74011609 + 89529444 = 8603^2 + 9462^2 .
It is a cyclic number.
It is not a de Polignac number, because 163541053 - 221 = 161443901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163541057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6290028 + ... + 6290053.
It is an arithmetic number, because the mean of its divisors is an integer number (44030287).
Almost surely, 2163541053 is an apocalyptic number.
163541053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
163541053 is a deficient number, since it is larger than the sum of its proper divisors (12580095).
163541053 is a wasteful number, since it uses less digits than its factorization.
163541053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12580094.
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 163541053 is about 12788.3170511213. The cubic root of 163541053 is about 546.8592929062.
The spelling of 163541053 in words is "one hundred sixty-three million, five hundred forty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.009 sec. • engine limits •