Base | Representation |
---|---|
bin | 100101001010001001101011… |
… | …111010010100000010011101 |
3 | 210102122022022021011212011101 |
4 | 211022021223322110002131 |
5 | 132410030021402430331 |
6 | 1335324315335553101 |
7 | 46265042452333105 |
oct | 4512115372240235 |
9 | 712568267155141 |
10 | 163425316061341 |
11 | 480883184779a4 |
12 | 163b4b0782b791 |
13 | 7025c309cb3c9 |
14 | 2c4db82942205 |
15 | 13d6102cb5061 |
hex | 94a26be9409d |
163425316061341 has 8 divisors (see below), whose sum is σ = 163887134523264. Its totient is φ = 162963587371200.
The previous prime is 163425316061321. The next prime is 163425316061459. The reversal of 163425316061341 is 143160613524361.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 163425316061341 - 225 = 163425282506909 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 163425316061291 and 163425316061300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163425316061321) 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, 18796060 + ... + 26079541.
It is an arithmetic number, because the mean of its divisors is an integer number (20485891815408).
Almost surely, 2163425316061341 is an apocalyptic number.
It is an amenable number.
163425316061341 is a deficient number, since it is larger than the sum of its proper divisors (461818461923).
163425316061341 is an equidigital number, since it uses as much as digits as its factorization.
163425316061341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44885891.
The product of its (nonzero) digits is 933120, while the sum is 46.
The spelling of 163425316061341 in words is "one hundred sixty-three trillion, four hundred twenty-five billion, three hundred sixteen million, sixty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •