Base | Representation |
---|---|
bin | 1001011010010110101… |
… | …0110010001110000001 |
3 | 120110100200100222022020 |
4 | 2112211222302032001 |
5 | 10122121432340322 |
6 | 202140355232053 |
7 | 14452623626310 |
oct | 2264552621601 |
9 | 513320328266 |
10 | 161693246337 |
11 | 626346931a7 |
12 | 274068a8629 |
13 | 1232acc012c |
14 | 7b7c75c277 |
15 | 431545a05c |
hex | 25a5ab2381 |
161693246337 has 8 divisors (see below), whose sum is σ = 246389708736. Its totient is φ = 92396140752.
The previous prime is 161693246317. The next prime is 161693246369. The reversal of 161693246337 is 733642396161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 161693246337 - 210 = 161693245313 is a prime.
It is a super-2 number, since 2×1616932463372 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 161693246337.
It is not an unprimeable number, because it can be changed into a prime (161693246317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3849839178 + ... + 3849839219.
It is an arithmetic number, because the mean of its divisors is an integer number (30798713592).
Almost surely, 2161693246337 is an apocalyptic number.
It is an amenable number.
161693246337 is a deficient number, since it is larger than the sum of its proper divisors (84696462399).
161693246337 is an equidigital number, since it uses as much as digits as its factorization.
161693246337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7699678407.
The product of its digits is 2939328, while the sum is 51.
The spelling of 161693246337 in words is "one hundred sixty-one billion, six hundred ninety-three million, two hundred forty-six thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •