Base | Representation |
---|---|
bin | 1110111010011011… |
… | …0001110111111001 |
3 | 101022222121202001112 |
4 | 3232212301313321 |
5 | 31144301040121 |
6 | 1501121130105 |
7 | 201126104213 |
oct | 35646616771 |
9 | 11288552045 |
10 | 4003143161 |
11 | 1774740786 |
12 | 938789935 |
13 | 4ba482284 |
14 | 29d9315b3 |
15 | 18669675b |
hex | ee9b1df9 |
4003143161 has 2 divisors, whose sum is σ = 4003143162. Its totient is φ = 4003143160.
The previous prime is 4003143127. The next prime is 4003143163. The reversal of 4003143161 is 1613413004.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3593283136 + 409860025 = 59944^2 + 20245^2 .
It is a cyclic number.
It is not a de Polignac number, because 4003143161 - 218 = 4002881017 is a prime.
It is a super-2 number, since 2×40031431612 = 32050310334922143842, which contains 22 as substring.
Together with 4003143163, 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 (4003143163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2001571580 + 2001571581.
It is an arithmetic number, because the mean of its divisors is an integer number (2001571581).
Almost surely, 24003143161 is an apocalyptic number.
It is an amenable number.
4003143161 is a deficient number, since it is larger than the sum of its proper divisors (1).
4003143161 is an equidigital number, since it uses as much as digits as its factorization.
4003143161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 4003143161 is about 63270.3971933162. The cubic root of 4003143161 is about 1587.8167311981.
Adding to 4003143161 its reverse (1613413004), we get a palindrome (5616556165).
The spelling of 4003143161 in words is "four billion, three million, one hundred forty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •