Base | Representation |
---|---|
bin | 1001101101111100001… |
… | …0010110000110010000 |
3 | 120221221002011211211221 |
4 | 2123133002112012100 |
5 | 10213403334104331 |
6 | 204410204414424 |
7 | 15030123314041 |
oct | 2333702260620 |
9 | 527832154757 |
10 | 166950691216 |
11 | 64892349371 |
12 | 28433547414 |
13 | 12988299c6a |
14 | 811aab68c8 |
15 | 4521cb6711 |
hex | 26df096190 |
166950691216 has 15 divisors (see below), whose sum is σ = 323470130881. Its totient is φ = 83474528416.
The previous prime is 166950691211. The next prime is 166950691333. The reversal of 166950691216 is 612196059661.
It is a happy number.
The square root of 166950691216 is 408596.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 14351081616 + 152599609600 = 119796^2 + 390640^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (166950691211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 1583310 + ... + 1685458.
Almost surely, 2166950691216 is an apocalyptic number.
166950691216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
166950691216 is the 408596-th square number.
It is an amenable number.
166950691216 is a deficient number, since it is larger than the sum of its proper divisors (156519439665).
166950691216 is an frugal number, since it uses more digits than its factorization.
166950691216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204306 (or 102151 counting only the distinct ones).
The product of its (nonzero) digits is 1049760, while the sum is 52.
The spelling of 166950691216 in words is "one hundred sixty-six billion, nine hundred fifty million, six hundred ninety-one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •