Base | Representation |
---|---|
bin | 10011011100101… |
… | …00001110101001 |
3 | 102100222012002211 |
4 | 21232110032221 |
5 | 313230331200 |
6 | 24104325121 |
7 | 4020431254 |
oct | 1156241651 |
9 | 370865084 |
10 | 163136425 |
11 | 840a48a1 |
12 | 467737a1 |
13 | 27a4b23a |
14 | 1794809b |
15 | e4c6aba |
hex | 9b943a9 |
163136425 has 6 divisors (see below), whose sum is σ = 202289198. Its totient is φ = 130509120.
The previous prime is 163136411. The next prime is 163136459. The reversal of 163136425 is 524631361.
163136425 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 3 ways, for example, as 17909824 + 145226601 = 4232^2 + 12051^2 .
It is not a de Polignac number, because 163136425 - 27 = 163136297 is a prime.
It is a super-2 number, since 2×1631364252 = 53226986323561250, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3262704 + ... + 3262753.
Almost surely, 2163136425 is an apocalyptic number.
It is an amenable number.
163136425 is a deficient number, since it is larger than the sum of its proper divisors (39152773).
163136425 is an equidigital number, since it uses as much as digits as its factorization.
163136425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6525467 (or 6525462 counting only the distinct ones).
The product of its digits is 12960, while the sum is 31.
The square root of 163136425 is about 12772.4870326808. The cubic root of 163136425 is about 546.4079132285.
Adding to 163136425 its reverse (524631361), we get a palindrome (687767786).
It can be divided in two parts, 16 and 3136425, that added together give a square (3136441 = 17712).
The spelling of 163136425 in words is "one hundred sixty-three million, one hundred thirty-six thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •