Base | Representation |
---|---|
bin | 100101001010011001110100… |
… | …110111001100000010011011 |
3 | 210102200222001000201100121011 |
4 | 211022121310313030002123 |
5 | 132410321014400400032 |
6 | 1335340303130554351 |
7 | 46266225064310323 |
oct | 4512316467140233 |
9 | 712628030640534 |
10 | 163442646106267 |
11 | 48094700871180 |
12 | 163b83435989b7 |
13 | 70277631abb68 |
14 | 2c509483b6283 |
15 | 13d67b9433247 |
hex | 94a674dcc09b |
163442646106267 has 16 divisors (see below), whose sum is σ = 181665961578720. Its totient is φ = 145780168435200.
The previous prime is 163442646106249. The next prime is 163442646106351. The reversal of 163442646106267 is 762601646244361.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-163442646106267 is a prime.
It is a super-4 number, since 4×1634426461062674 (a number of 58 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (163442646106247) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 223430467 + ... + 224160787.
It is an arithmetic number, because the mean of its divisors is an integer number (11354122598670).
Almost surely, 2163442646106267 is an apocalyptic number.
163442646106267 is a deficient number, since it is larger than the sum of its proper divisors (18223315472453).
163442646106267 is a wasteful number, since it uses less digits than its factorization.
163442646106267 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1114254.
The product of its (nonzero) digits is 41803776, while the sum is 58.
The spelling of 163442646106267 in words is "one hundred sixty-three trillion, four hundred forty-two billion, six hundred forty-six million, one hundred six thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •