Base | Representation |
---|---|
bin | 100101011000111100001110… |
… | …110111001010111010101101 |
3 | 210120020110200011202110010020 |
4 | 211120330032313022322231 |
5 | 133023203011011034423 |
6 | 1341423242353032353 |
7 | 46431342454120332 |
oct | 4530741667127255 |
9 | 716213604673106 |
10 | 164441662205613 |
11 | 4843a354369a31 |
12 | 16539a8bb556b9 |
13 | 709aa22686360 |
14 | 2c87039ca2989 |
15 | 14027895e84e3 |
hex | 958f0edcaead |
164441662205613 has 8 divisors (see below), whose sum is σ = 236121361115808. Its totient is φ = 101194869049584.
The previous prime is 164441662205593. The next prime is 164441662205621. The reversal of 164441662205613 is 316502266144461.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 164441662205613 - 28 = 164441662205357 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164441662205813) 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, 2108226438495 + ... + 2108226438572.
It is an arithmetic number, because the mean of its divisors is an integer number (29515170139476).
Almost surely, 2164441662205613 is an apocalyptic number.
164441662205613 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
164441662205613 is a deficient number, since it is larger than the sum of its proper divisors (71679698910195).
164441662205613 is a wasteful number, since it uses less digits than its factorization.
164441662205613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4216452877083.
The product of its (nonzero) digits is 4976640, while the sum is 51.
The spelling of 164441662205613 in words is "one hundred sixty-four trillion, four hundred forty-one billion, six hundred sixty-two million, two hundred five thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •