Base | Representation |
---|---|
bin | 100101110110000010100101… |
… | …001001011000110010010101 |
3 | 210211022122012101122001201100 |
4 | 211312002211021120302111 |
5 | 133303433332344343203 |
6 | 1345554033024020313 |
7 | 50025663435341013 |
oct | 4566024511306225 |
9 | 724278171561640 |
10 | 166441343356053 |
11 | 49040417231387 |
12 | 16801545161699 |
13 | 71b4474b5003c |
14 | 2d15b382738b3 |
15 | 14397c45e1ea3 |
hex | 9760a5258c95 |
166441343356053 has 12 divisors (see below), whose sum is σ = 240437681861260. Its totient is φ = 110950553359296.
The previous prime is 166441343356037. The next prime is 166441343356081. The reversal of 166441343356053 is 350653343144661.
166441343356053 is a `hidden beast` number, since 1 + 6 + 6 + 4 + 41 + 3 + 4 + 33 + 560 + 5 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 137486365309764 + 28954978046289 = 11725458^2 + 5380983^2 .
It is not a de Polignac number, because 166441343356053 - 24 = 166441343356037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166441343356003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 861749026 + ... + 861942147.
Almost surely, 2166441343356053 is an apocalyptic number.
It is an amenable number.
166441343356053 is a deficient number, since it is larger than the sum of its proper divisors (73996338505207).
166441343356053 is a wasteful number, since it uses less digits than its factorization.
166441343356053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1723701908 (or 1723701905 counting only the distinct ones).
The product of its (nonzero) digits is 27993600, while the sum is 54.
The spelling of 166441343356053 in words is "one hundred sixty-six trillion, four hundred forty-one billion, three hundred forty-three million, three hundred fifty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •