Base | Representation |
---|---|
bin | 1001101011100011101… |
… | …1110000110010100001 |
3 | 120220021112022002010211 |
4 | 2122320323300302201 |
5 | 10211101211300304 |
6 | 204222531054121 |
7 | 15005231561431 |
oct | 2327073606241 |
9 | 526245262124 |
10 | 166311431329 |
11 | 64594515a0a |
12 | 28295441341 |
13 | 128b5a06684 |
14 | 8099c302c1 |
15 | 44d5ae1204 |
hex | 26b8ef0ca1 |
166311431329 has 2 divisors, whose sum is σ = 166311431330. Its totient is φ = 166311431328.
The previous prime is 166311431309. The next prime is 166311431333. The reversal of 166311431329 is 923134113661.
166311431329 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., 99902141329 + 66409290000 = 316073^2 + 257700^2 .
It is a cyclic number.
It is not a de Polignac number, because 166311431329 - 213 = 166311423137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 166311431291 and 166311431300.
It is not a weakly prime, because it can be changed into another prime (166311431309) 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, 83155715664 + 83155715665.
It is an arithmetic number, because the mean of its divisors is an integer number (83155715665).
Almost surely, 2166311431329 is an apocalyptic number.
It is an amenable number.
166311431329 is a deficient number, since it is larger than the sum of its proper divisors (1).
166311431329 is an equidigital number, since it uses as much as digits as its factorization.
166311431329 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69984, while the sum is 40.
The spelling of 166311431329 in words is "one hundred sixty-six billion, three hundred eleven million, four hundred thirty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •