Base | Representation |
---|---|
bin | 100101110101010101100001… |
… | …111001010101011110011101 |
3 | 210211011000100012110001001202 |
4 | 211311111201321111132131 |
5 | 133302140300412400321 |
6 | 1345515513024245245 |
7 | 50022331631315051 |
oct | 4565254171253635 |
9 | 724130305401052 |
10 | 166392970434461 |
11 | 49021953a55431 |
12 | 167b40a5170825 |
13 | 71aca36207304 |
14 | 2d13669a85c61 |
15 | 14383e29e970b |
hex | 975561e5579d |
166392970434461 has 2 divisors, whose sum is σ = 166392970434462. Its totient is φ = 166392970434460.
The previous prime is 166392970434451. The next prime is 166392970434491. The reversal of 166392970434461 is 164434079293661.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95282372490361 + 71110597944100 = 9761269^2 + 8432710^2 .
It is a cyclic number.
It is not a de Polignac number, because 166392970434461 - 234 = 166375790565277 is a prime.
It is a super-2 number, since 2×1663929704344612 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (166392970434451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 83196485217230 + 83196485217231.
It is an arithmetic number, because the mean of its divisors is an integer number (83196485217231).
Almost surely, 2166392970434461 is an apocalyptic number.
It is an amenable number.
166392970434461 is a deficient number, since it is larger than the sum of its proper divisors (1).
166392970434461 is an equidigital number, since it uses as much as digits as its factorization.
166392970434461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141087744, while the sum is 65.
The spelling of 166392970434461 in words is "one hundred sixty-six trillion, three hundred ninety-two billion, nine hundred seventy million, four hundred thirty-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.859 sec. • engine limits •