Base | Representation |
---|---|
bin | 10011011011111… |
… | …11001010100101 |
3 | 102100210210202102 |
4 | 21231333022211 |
5 | 313220101044 |
6 | 24102421445 |
7 | 4016621603 |
oct | 1155771245 |
9 | 370723672 |
10 | 163050149 |
11 | 84045a99 |
12 | 46731885 |
13 | 27a1aba2 |
14 | 17924873 |
15 | e4ab24e |
hex | 9b7f2a5 |
163050149 has 4 divisors (see below), whose sum is σ = 163090764. Its totient is φ = 163009536.
The previous prime is 163050143. The next prime is 163050161. The reversal of 163050149 is 941050361.
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 9042049 + 154008100 = 3007^2 + 12410^2 .
It is a cyclic number.
It is not a de Polignac number, because 163050149 - 220 = 162001573 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163050143) 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, 13532 + ... + 22565.
It is an arithmetic number, because the mean of its divisors is an integer number (40772691).
Almost surely, 2163050149 is an apocalyptic number.
It is an amenable number.
163050149 is a deficient number, since it is larger than the sum of its proper divisors (40615).
163050149 is an equidigital number, since it uses as much as digits as its factorization.
163050149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40614.
The product of its (nonzero) digits is 3240, while the sum is 29.
The square root of 163050149 is about 12769.1091701810. The cubic root of 163050149 is about 546.3115721814.
The spelling of 163050149 in words is "one hundred sixty-three million, fifty thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •