Base | Representation |
---|---|
bin | 1000000101100111… |
… | …10101011111010001 |
3 | 102012121110001100212 |
4 | 10002303311133101 |
5 | 32343040011121 |
6 | 1554510253505 |
7 | 212413220204 |
oct | 40263653721 |
9 | 12177401325 |
10 | 4342110161 |
11 | 192900a6a4 |
12 | a121b7295 |
13 | 54277466c |
14 | 2d296993b |
15 | 1a630125b |
hex | 102cf57d1 |
4342110161 has 2 divisors, whose sum is σ = 4342110162. Its totient is φ = 4342110160.
The previous prime is 4342110119. The next prime is 4342110163. The reversal of 4342110161 is 1610112434.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3954020161 + 388090000 = 62881^2 + 19700^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4342110161 is a prime.
Together with 4342110163, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (4342110163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2171055080 + 2171055081.
It is an arithmetic number, because the mean of its divisors is an integer number (2171055081).
Almost surely, 24342110161 is an apocalyptic number.
It is an amenable number.
4342110161 is a deficient number, since it is larger than the sum of its proper divisors (1).
4342110161 is an equidigital number, since it uses as much as digits as its factorization.
4342110161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
The square root of 4342110161 is about 65894.6899302212. The cubic root of 4342110161 is about 1631.4243713993.
Adding to 4342110161 its reverse (1610112434), we get a palindrome (5952222595).
The spelling of 4342110161 in words is "four billion, three hundred forty-two million, one hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •