Base | Representation |
---|---|
bin | 100101011000101000011110… |
… | …000010101100000010111111 |
3 | 210120011102220022021200102222 |
4 | 211120220132002230002333 |
5 | 133022331031130443110 |
6 | 1341405412555235555 |
7 | 46426661554544564 |
oct | 4530503602540277 |
9 | 716142808250388 |
10 | 164420442046655 |
11 | 48431355115483 |
12 | 16535949448bbb |
13 | 7098a20279692 |
14 | 2c85dc592086b |
15 | 1401e466adc55 |
hex | 958a1e0ac0bf |
164420442046655 has 8 divisors (see below), whose sum is σ = 199681693474032. Its totient is φ = 129951578291968.
The previous prime is 164420442046633. The next prime is 164420442046709. The reversal of 164420442046655 is 556640244024461.
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 164420442046655 - 234 = 164403262177471 is a prime.
It is a super-3 number, since 3×1644204420466553 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 164420442046597 and 164420442046606.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 198096917714 + ... + 198096918543.
It is an arithmetic number, because the mean of its divisors is an integer number (24960211684254).
Almost surely, 2164420442046655 is an apocalyptic number.
164420442046655 is a deficient number, since it is larger than the sum of its proper divisors (35261251427377).
164420442046655 is an equidigital number, since it uses as much as digits as its factorization.
164420442046655 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 396193836345.
The product of its (nonzero) digits is 22118400, while the sum is 53.
The spelling of 164420442046655 in words is "one hundred sixty-four trillion, four hundred twenty billion, four hundred forty-two million, forty-six thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •