Base | Representation |
---|---|
bin | 100100101010111101100100… |
… | …101000010111111011111101 |
3 | 210011001102001020201211221221 |
4 | 210222331210220113323331 |
5 | 132114421021320100001 |
6 | 1331003532542353341 |
7 | 45654145304043061 |
oct | 4452754450277375 |
9 | 704042036654857 |
10 | 161282005237501 |
11 | 47431350386025 |
12 | 1610964928b851 |
13 | 6bcba9b9a31b5 |
14 | 2bb813ac6baa1 |
15 | 139a4ad5c61a1 |
hex | 92af64a17efd |
161282005237501 has 4 divisors (see below), whose sum is σ = 161282174113852. Its totient is φ = 161281836361152.
The previous prime is 161282005237489. The next prime is 161282005237519. The reversal of 161282005237501 is 105732500282161.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 55894329015001 + 105387676222500 = 7476251^2 + 10265850^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-161282005237501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161282005237571) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82997436 + ... + 84918421.
It is an arithmetic number, because the mean of its divisors is an integer number (40320543528463).
Almost surely, 2161282005237501 is an apocalyptic number.
It is an amenable number.
161282005237501 is a deficient number, since it is larger than the sum of its proper divisors (168876351).
161282005237501 is an equidigital number, since it uses as much as digits as its factorization.
161282005237501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168876350.
The product of its (nonzero) digits is 201600, while the sum is 43.
The spelling of 161282005237501 in words is "one hundred sixty-one trillion, two hundred eighty-two billion, five million, two hundred thirty-seven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.155 sec. • engine limits •