Base | Representation |
---|---|
bin | 100101110110000010100101… |
… | …001001011000110010011111 |
3 | 210211022122012101122001201201 |
4 | 211312002211021120302133 |
5 | 133303433332344343223 |
6 | 1345554033024020331 |
7 | 50025663435341026 |
oct | 4566024511306237 |
9 | 724278171561651 |
10 | 166441343356063 |
11 | 49040417231396 |
12 | 168015451616a7 |
13 | 71b4474b50049 |
14 | 2d15b382738bd |
15 | 14397c45e1ead |
hex | 9760a5258c9f |
166441343356063 has 16 divisors (see below), whose sum is σ = 181049573200320. Its totient is φ = 152370949602816.
The previous prime is 166441343356037. The next prime is 166441343356081. The reversal of 166441343356063 is 360653343144661.
It is a cyclic number.
It is not a de Polignac number, because 166441343356063 - 213 = 166441343347871 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 166441343355995 and 166441343356013.
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 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, 37775656 + ... + 41950957.
It is an arithmetic number, because the mean of its divisors is an integer number (11315598325020).
Almost surely, 2166441343356063 is an apocalyptic number.
166441343356063 is a deficient number, since it is larger than the sum of its proper divisors (14608229844257).
166441343356063 is a wasteful number, since it uses less digits than its factorization.
166441343356063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79729986.
The product of its (nonzero) digits is 33592320, while the sum is 55.
The spelling of 166441343356063 in words is "one hundred sixty-six trillion, four hundred forty-one billion, three hundred forty-three million, three hundred fifty-six thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •