Base | Representation |
---|---|
bin | 100100101000110010000101… |
… | …101010111101000101111001 |
3 | 210010112002110112221101110022 |
4 | 210220302011222331011321 |
5 | 132104442304320103440 |
6 | 1330411043245500225 |
7 | 45640264004040602 |
oct | 4450620552750571 |
9 | 703462415841408 |
10 | 161132235706745 |
11 | 47383885390926 |
12 | 160a460b871675 |
13 | 6bba9210b8794 |
14 | 2bb0badd50da9 |
15 | 1396644d6dcb5 |
hex | 928c85abd179 |
161132235706745 has 8 divisors (see below), whose sum is σ = 195132615718920. Its totient is φ = 127723166651520.
The previous prime is 161132235706669. The next prime is 161132235706769. The reversal of 161132235706745 is 547607532231161.
It can be written as a sum of positive squares in 4 ways, for example, as 1368020301376 + 159764215405369 = 1169624^2 + 12639787^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 161132235706745 - 232 = 161127940739449 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 147827738636 + ... + 147827739725.
It is an arithmetic number, because the mean of its divisors is an integer number (24391576964865).
Almost surely, 2161132235706745 is an apocalyptic number.
It is an amenable number.
161132235706745 is a deficient number, since it is larger than the sum of its proper divisors (34000380012175).
161132235706745 is a wasteful number, since it uses less digits than its factorization.
161132235706745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295655478475.
The product of its (nonzero) digits is 6350400, while the sum is 53.
The spelling of 161132235706745 in words is "one hundred sixty-one trillion, one hundred thirty-two billion, two hundred thirty-five million, seven hundred six thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •