Base | Representation |
---|---|
bin | 100101011011000001001000… |
… | …011010111011000111100101 |
3 | 210120202010000011012221101211 |
4 | 211123001020122323013211 |
5 | 133033022233110101130 |
6 | 1342013002332351421 |
7 | 46444553625503566 |
oct | 4533011032730745 |
9 | 716663004187354 |
10 | 164584361800165 |
11 | 4849492159244a |
12 | 16561675915571 |
13 | 70ab31461c378 |
14 | 2c8dcd5c5a16d |
15 | 140633c31ea2a |
hex | 95b0486bb1e5 |
164584361800165 has 8 divisors (see below), whose sum is σ = 197680292402688. Its totient is φ = 131548117278480.
The previous prime is 164584361800121. The next prime is 164584361800189. The reversal of 164584361800165 is 561008163485461.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 164584361800165 - 29 = 164584361799653 is a prime.
It is a super-2 number, since 2×1645843618001652 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
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, 14921514141 + ... + 14921525170.
It is an arithmetic number, because the mean of its divisors is an integer number (24710036550336).
Almost surely, 2164584361800165 is an apocalyptic number.
It is an amenable number.
164584361800165 is a deficient number, since it is larger than the sum of its proper divisors (33095930602523).
164584361800165 is a wasteful number, since it uses less digits than its factorization.
164584361800165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29843040419.
The product of its (nonzero) digits is 16588800, while the sum is 58.
The spelling of 164584361800165 in words is "one hundred sixty-four trillion, five hundred eighty-four billion, three hundred sixty-one million, eight hundred thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •