Base | Representation |
---|---|
bin | 100100110001101101100100… |
… | …011101011001011110010101 |
3 | 210012200202100000002201022201 |
4 | 210301231210131121132111 |
5 | 132200021004330000211 |
6 | 1332001004410524501 |
7 | 46032516110362045 |
oct | 4461554435313625 |
9 | 705622300081281 |
10 | 161745858828181 |
11 | 475a004066a171 |
12 | 16183520a36731 |
13 | 6c3375224a694 |
14 | 2bd2781605725 |
15 | 13a75aabc70c1 |
hex | 931b64759795 |
161745858828181 has 8 divisors (see below), whose sum is σ = 164161423034720. Its totient is φ = 159330337177968.
The previous prime is 161745858828173. The next prime is 161745858828233. The reversal of 161745858828181 is 181828858547161.
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 161745858828181 - 23 = 161745858828173 is a prime.
It is a super-2 number, since 2×1617458588281812 (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 (161745858828101) 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, 2939526 + ... + 18224503.
It is an arithmetic number, because the mean of its divisors is an integer number (20520177879340).
Almost surely, 2161745858828181 is an apocalyptic number.
It is an amenable number.
161745858828181 is a deficient number, since it is larger than the sum of its proper divisors (2415564206539).
161745858828181 is a wasteful number, since it uses less digits than its factorization.
161745858828181 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21278163.
The product of its digits is 275251200, while the sum is 73.
The spelling of 161745858828181 in words is "one hundred sixty-one trillion, seven hundred forty-five billion, eight hundred fifty-eight million, eight hundred twenty-eight thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •