Base | Representation |
---|---|
bin | 100100101000110010100100… |
… | …100010000101101011001101 |
3 | 210010112010210122012210202112 |
4 | 210220302210202011223031 |
5 | 132104444334342220201 |
6 | 1330411210503233405 |
7 | 45640312562024045 |
oct | 4450624442055315 |
9 | 703463718183675 |
10 | 161132753476301 |
11 | 47384020684852 |
12 | 160a4735148865 |
13 | 6bba9a44529b9 |
14 | 2bb0c1ca10725 |
15 | 13966755470bb |
hex | 928ca4885acd |
161132753476301 has 2 divisors, whose sum is σ = 161132753476302. Its totient is φ = 161132753476300.
The previous prime is 161132753476283. The next prime is 161132753476307. The reversal of 161132753476301 is 103674357231161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115495838116201 + 45636915360100 = 10746899^2 + 6755510^2 .
It is a cyclic number.
It is not a de Polignac number, because 161132753476301 - 218 = 161132753214157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 161132753476301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161132753476307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80566376738150 + 80566376738151.
It is an arithmetic number, because the mean of its divisors is an integer number (80566376738151).
Almost surely, 2161132753476301 is an apocalyptic number.
It is an amenable number.
161132753476301 is a deficient number, since it is larger than the sum of its proper divisors (1).
161132753476301 is an equidigital number, since it uses as much as digits as its factorization.
161132753476301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1905120, while the sum is 50.
The spelling of 161132753476301 in words is "one hundred sixty-one trillion, one hundred thirty-two billion, seven hundred fifty-three million, four hundred seventy-six thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •