Base | Representation |
---|---|
bin | 100100101111111111111011… |
… | …011100011110010110111101 |
3 | 210012021111110110220221220211 |
4 | 210233333323130132112331 |
5 | 132141103404003030443 |
6 | 1331430534510512421 |
7 | 46021150543231033 |
oct | 4457777334362675 |
9 | 705244413827824 |
10 | 161628132861373 |
11 | 475551193aa922 |
12 | 16164746805711 |
13 | 6c256102161a9 |
14 | 2bcabb42cc553 |
15 | 13a44ba6b419d |
hex | 92fffb71e5bd |
161628132861373 has 8 divisors (see below), whose sum is σ = 165081918177792. Its totient is φ = 158174967914736.
The previous prime is 161628132861367. The next prime is 161628132861383. The reversal of 161628132861373 is 373168231826161.
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 161628132861373 - 29 = 161628132860861 is a prime.
It is a super-2 number, since 2×1616281328613732 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161628132861313) 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, 154565790 + ... + 155607967.
It is an arithmetic number, because the mean of its divisors is an integer number (20635239772224).
Almost surely, 2161628132861373 is an apocalyptic number.
It is an amenable number.
161628132861373 is a deficient number, since it is larger than the sum of its proper divisors (3453785316419).
161628132861373 is a wasteful number, since it uses less digits than its factorization.
161628132861373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310184891.
The product of its digits is 10450944, while the sum is 58.
The spelling of 161628132861373 in words is "one hundred sixty-one trillion, six hundred twenty-eight billion, one hundred thirty-two million, eight hundred sixty-one thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •