Base | Representation |
---|---|
bin | 1001101010110001100… |
… | …1110110010010011001 |
3 | 120212201212201221200012 |
4 | 2122230121312102121 |
5 | 10210133402324421 |
6 | 204150021251305 |
7 | 15000100012115 |
oct | 2325431662231 |
9 | 525655657605 |
10 | 166101214361 |
11 | 64496894885 |
12 | 28236b63b35 |
13 | 128812b2b34 |
14 | 8079d4c745 |
15 | 44c241995b |
hex | 26ac676499 |
166101214361 has 2 divisors, whose sum is σ = 166101214362. Its totient is φ = 166101214360.
The previous prime is 166101214319. The next prime is 166101214369. The reversal of 166101214361 is 163412101661.
166101214361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 165694587136 + 406627225 = 407056^2 + 20165^2 .
It is a cyclic number.
It is not a de Polignac number, because 166101214361 - 230 = 165027472537 is a prime.
It is a super-2 number, since 2×1661012143612 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (166101214369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 83050607180 + 83050607181.
It is an arithmetic number, because the mean of its divisors is an integer number (83050607181).
Almost surely, 2166101214361 is an apocalyptic number.
It is an amenable number.
166101214361 is a deficient number, since it is larger than the sum of its proper divisors (1).
166101214361 is an equidigital number, since it uses as much as digits as its factorization.
166101214361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 166101214361 in words is "one hundred sixty-six billion, one hundred one million, two hundred fourteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •