Base | Representation |
---|---|
bin | 100101111011010110001000… |
… | …111111101100101001011001 |
3 | 210212121111021222200221110202 |
4 | 211323112020333230221121 |
5 | 133330422032434232243 |
6 | 1350433331545351545 |
7 | 50064221526452645 |
oct | 4573261077545131 |
9 | 725544258627422 |
10 | 166805943274073 |
11 | 491710043a1184 |
12 | 16860138a985b5 |
13 | 720c96b3c79bc |
14 | 2d29644b43c25 |
15 | 144401327c4b8 |
hex | 97b588feca59 |
166805943274073 has 2 divisors, whose sum is σ = 166805943274074. Its totient is φ = 166805943274072.
The previous prime is 166805943274039. The next prime is 166805943274081. The reversal of 166805943274073 is 370472349508661.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130336084089289 + 36469859184784 = 11416483^2 + 6039028^2 .
It is a cyclic number.
It is not a de Polignac number, because 166805943274073 - 28 = 166805943273817 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (166805943277073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 83402971637036 + 83402971637037.
It is an arithmetic number, because the mean of its divisors is an integer number (83402971637037).
It is a 1-persistent number, because it is pandigital, but 2⋅166805943274073 = 333611886548146 is not.
Almost surely, 2166805943274073 is an apocalyptic number.
It is an amenable number.
166805943274073 is a deficient number, since it is larger than the sum of its proper divisors (1).
166805943274073 is an equidigital number, since it uses as much as digits as its factorization.
166805943274073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 182891520, while the sum is 65.
The spelling of 166805943274073 in words is "one hundred sixty-six trillion, eight hundred five billion, nine hundred forty-three million, two hundred seventy-four thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •