Base | Representation |
---|---|
bin | 1111000011101110… |
… | …0011011011100101 |
3 | 101102201000011102002 |
4 | 3300323203123211 |
5 | 31234242042321 |
6 | 1505033055045 |
7 | 202111436546 |
oct | 36073433345 |
9 | 11381004362 |
10 | 4042143461 |
11 | 1794759234 |
12 | 949857485 |
13 | 4c5588a85 |
14 | 2a4ba44cd |
15 | 189cec20b |
hex | f0ee36e5 |
4042143461 has 2 divisors, whose sum is σ = 4042143462. Its totient is φ = 4042143460.
The previous prime is 4042143401. The next prime is 4042143463. The reversal of 4042143461 is 1643412404.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4022730625 + 19412836 = 63425^2 + 4406^2 .
It is a cyclic number.
It is not a de Polignac number, because 4042143461 - 226 = 3975034597 is a prime.
Together with 4042143463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4042143463) 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, 2021071730 + 2021071731.
It is an arithmetic number, because the mean of its divisors is an integer number (2021071731).
Almost surely, 24042143461 is an apocalyptic number.
It is an amenable number.
4042143461 is a deficient number, since it is larger than the sum of its proper divisors (1).
4042143461 is an equidigital number, since it uses as much as digits as its factorization.
4042143461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 29.
The square root of 4042143461 is about 63577.8535419371. The cubic root of 4042143461 is about 1592.9564682302.
Adding to 4042143461 its reverse (1643412404), we get a palindrome (5685555865).
The spelling of 4042143461 in words is "four billion, forty-two million, one hundred forty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •