Base | Representation |
---|---|
bin | 100101111001101011000100… |
… | …100101110111011001111001 |
3 | 210212012111112221011122111000 |
4 | 211321223010211313121321 |
5 | 133322031111112041421 |
6 | 1350304440102355213 |
7 | 50053011565426530 |
oct | 4571530445673171 |
9 | 725174487148430 |
10 | 166690979018361 |
11 | 4912727a0382a6 |
12 | 168419b372bb09 |
13 | 7201b795a59a5 |
14 | 2d23c5a525317 |
15 | 144103543e226 |
hex | 979ac4977679 |
166690979018361 has 192 divisors, whose sum is σ = 312007425484800. Its totient is φ = 85896087120000.
The previous prime is 166690979018359. The next prime is 166690979018381. The reversal of 166690979018361 is 163810979096661.
It is not a de Polignac number, because 166690979018361 - 21 = 166690979018359 is a prime.
It is a Smith number, since the sum of its digits (72) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 166690979018361.
It is not an unprimeable number, because it can be changed into a prime (166690979018381) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 210112086 + ... + 210903936.
It is an arithmetic number, because the mean of its divisors is an integer number (1625038674400).
Almost surely, 2166690979018361 is an apocalyptic number.
It is an amenable number.
166690979018361 is a deficient number, since it is larger than the sum of its proper divisors (145316446466439).
166690979018361 is a wasteful number, since it uses less digits than its factorization.
166690979018361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 792009 (or 791972 counting only the distinct ones).
The product of its (nonzero) digits is 158723712, while the sum is 72.
The spelling of 166690979018361 in words is "one hundred sixty-six trillion, six hundred ninety billion, nine hundred seventy-nine million, eighteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •