Base | Representation |
---|---|
bin | 100101111001110011111011… |
… | …000011101110000000101101 |
3 | 210212020102002021010011021201 |
4 | 211321303323003232000231 |
5 | 133322210042040422321 |
6 | 1350313051120325501 |
7 | 50053466236001464 |
oct | 4571637303560055 |
9 | 725212067104251 |
10 | 166700482748461 |
11 | 491303067033a2 |
12 | 16843806473891 |
13 | 7202a32515b1c |
14 | 2d244bc7c39db |
15 | 14413de96e291 |
hex | 979cfb0ee02d |
166700482748461 has 8 divisors (see below), whose sum is σ = 166774920966144. Its totient is φ = 166626060974880.
The previous prime is 166700482748413. The next prime is 166700482748507. The reversal of 166700482748461 is 164847284007661.
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 166700482748461 - 213 = 166700482740269 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 166700482748393 and 166700482748402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166700482748411) 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, 16190676 + ... + 24403666.
It is an arithmetic number, because the mean of its divisors is an integer number (20846865120768).
Almost surely, 2166700482748461 is an apocalyptic number.
It is an amenable number.
166700482748461 is a deficient number, since it is larger than the sum of its proper divisors (74438217683).
166700482748461 is an equidigital number, since it uses as much as digits as its factorization.
166700482748461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8222051.
The product of its (nonzero) digits is 86704128, while the sum is 64.
The spelling of 166700482748461 in words is "one hundred sixty-six trillion, seven hundred billion, four hundred eighty-two million, seven hundred forty-eight thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •