Base | Representation |
---|---|
bin | 1111001010011001101001… |
… | …0000010011101110110110 |
3 | 2012000202200110121101020100 |
4 | 3302212122100103232312 |
5 | 4141120414121322131 |
6 | 55242414254014530 |
7 | 3340315513145040 |
oct | 362463220235666 |
9 | 65022613541210 |
10 | 16671356042166 |
11 | 5348311956641 |
12 | 1a5302b4a7446 |
13 | 93c1434ba777 |
14 | 418c7dd26a90 |
15 | 1dd9d84197e6 |
hex | f299a413bb6 |
16671356042166 has 48 divisors (see below), whose sum is σ = 41288556445344. Its totient is φ = 4762424961792.
The previous prime is 16671356042147. The next prime is 16671356042249. The reversal of 16671356042166 is 66124065317661.
16671356042166 is a `hidden beast` number, since 1 + 6 + 6 + 7 + 1 + 3 + 5 + 604 + 21 + 6 + 6 = 666.
It is a super-2 number, since 2×166713560421662 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 10648291 + ... + 12113166.
It is an arithmetic number, because the mean of its divisors is an integer number (860178259278).
Almost surely, 216671356042166 is an apocalyptic number.
16671356042166 is an abundant number, since it is smaller than the sum of its proper divisors (24617200403178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16671356042166 is a wasteful number, since it uses less digits than its factorization.
16671356042166 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22767285 (or 22767282 counting only the distinct ones).
The product of its (nonzero) digits is 6531840, while the sum is 54.
The spelling of 16671356042166 in words is "sixteen trillion, six hundred seventy-one billion, three hundred fifty-six million, forty-two thousand, one hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •