Base | Representation |
---|---|
bin | 100101110010010001011111… |
… | …111100011000100100111101 |
3 | 210210101220001001121121011201 |
4 | 211302101133330120210331 |
5 | 133240213211434003121 |
6 | 1345235102423415501 |
7 | 50001200610454021 |
oct | 4562213774304475 |
9 | 723356031547151 |
10 | 166182484281661 |
11 | 48a50661010451 |
12 | 1677b3418b4591 |
13 | 7195c305835c3 |
14 | 2d073bd052381 |
15 | 1432bc3b86e91 |
hex | 97245ff1893d |
166182484281661 has 2 divisors, whose sum is σ = 166182484281662. Its totient is φ = 166182484281660.
The previous prime is 166182484281607. The next prime is 166182484281677.
166182484281661 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 141662507666436 + 24519976615225 = 11902206^2 + 4951765^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 166182484281661 - 217 = 166182484150589 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 166182484281593 and 166182484281602.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (166182484281691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 83091242140830 + 83091242140831.
It is an arithmetic number, because the mean of its divisors is an integer number (83091242140831).
Almost surely, 2166182484281661 is an apocalyptic number.
It is an amenable number.
166182484281661 is a deficient number, since it is larger than the sum of its proper divisors (1).
166182484281661 is an equidigital number, since it uses as much as digits as its factorization.
166182484281661 is an evil number, because the sum of its binary digits is even.
The product of its digits is 42467328, while the sum is 64.
The spelling of 166182484281661 in words is "one hundred sixty-six trillion, one hundred eighty-two billion, four hundred eighty-four million, two hundred eighty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •