Base | Representation |
---|---|
bin | 100101110001001001011011… |
… | …111011111100011111110101 |
3 | 210210010111022112211021010201 |
4 | 211301021123323330133311 |
5 | 133232431230024141303 |
6 | 1345135344421520501 |
7 | 46662461262065203 |
oct | 4561113373743765 |
9 | 723114275737121 |
10 | 166105107646453 |
11 | 48a20864a08148 |
12 | 16768348573131 |
13 | 718b84bab2561 |
14 | 2d0375c87c073 |
15 | 1430b95b6181d |
hex | 97125befc7f5 |
166105107646453 has 8 divisors (see below), whose sum is σ = 168920861666400. Its totient is φ = 163289367400368.
The previous prime is 166105107646409. The next prime is 166105107646463. The reversal of 166105107646453 is 354646701501661.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-166105107646453 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 166105107646394 and 166105107646403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166105107646403) 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, 22525875 + ... + 28976287.
It is an arithmetic number, because the mean of its divisors is an integer number (21115107708300).
Almost surely, 2166105107646453 is an apocalyptic number.
It is an amenable number.
166105107646453 is a deficient number, since it is larger than the sum of its proper divisors (2815754019947).
166105107646453 is an equidigital number, since it uses as much as digits as its factorization.
166105107646453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6886931.
The product of its (nonzero) digits is 10886400, while the sum is 55.
The spelling of 166105107646453 in words is "one hundred sixty-six trillion, one hundred five billion, one hundred seven million, six hundred forty-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •