Base | Representation |
---|---|
bin | 10011011100101… |
… | …01011000011001 |
3 | 102100222102120122 |
4 | 21232111120121 |
5 | 313231004040 |
6 | 24104403025 |
7 | 4020451106 |
oct | 1156253031 |
9 | 370872518 |
10 | 163141145 |
11 | 840a83a2 |
12 | 46776475 |
13 | 27a5042b |
14 | 17949aad |
15 | e4c81b5 |
hex | 9b95619 |
163141145 has 8 divisors (see below), whose sum is σ = 198979080. Its totient is φ = 128373120.
The previous prime is 163141141. The next prime is 163141169. The reversal of 163141145 is 541141361.
163141145 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 17161 + 163123984 = 131^2 + 12772^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 163141145 - 22 = 163141141 is a prime.
It is a super-2 number, since 2×1631411452 = 53230066383822050, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (163141141) 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, 267140 + ... + 267749.
It is an arithmetic number, because the mean of its divisors is an integer number (24872385).
Almost surely, 2163141145 is an apocalyptic number.
It is an amenable number.
163141145 is a deficient number, since it is larger than the sum of its proper divisors (35837935).
163141145 is an equidigital number, since it uses as much as digits as its factorization.
163141145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 534955.
The product of its digits is 1440, while the sum is 26.
The square root of 163141145 is about 12772.6718035030. The cubic root of 163141145 is about 546.4131828885.
The spelling of 163141145 in words is "one hundred sixty-three million, one hundred forty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •