Base | Representation |
---|---|
bin | 1111000011101101… |
… | …1010000100110101 |
3 | 101102200221012211211 |
4 | 3300323122010311 |
5 | 31234234331031 |
6 | 1505032201421 |
7 | 202111220044 |
oct | 36073320465 |
9 | 11380835754 |
10 | 4042105141 |
11 | 1794732468 |
12 | 949839271 |
13 | 4c55744b9 |
14 | 2a4b9455b |
15 | 189ce0bb1 |
hex | f0eda135 |
4042105141 has 2 divisors, whose sum is σ = 4042105142. Its totient is φ = 4042105140.
The previous prime is 4042105099. The next prime is 4042105187. The reversal of 4042105141 is 1415012404.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4023364900 + 18740241 = 63430^2 + 4329^2 .
It is a cyclic number.
It is not a de Polignac number, because 4042105141 - 27 = 4042105013 is a prime.
It is a super-2 number, since 2×40421051412 = 32677227941797259762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4042105541) 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, 2021052570 + 2021052571.
It is an arithmetic number, because the mean of its divisors is an integer number (2021052571).
Almost surely, 24042105141 is an apocalyptic number.
It is an amenable number.
4042105141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4042105141 is an equidigital number, since it uses as much as digits as its factorization.
4042105141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 640, while the sum is 22.
The square root of 4042105141 is about 63577.5521784222. The cubic root of 4042105141 is about 1592.9514344088.
Adding to 4042105141 its reverse (1415012404), we get a palindrome (5457117545).
The spelling of 4042105141 in words is "four billion, forty-two million, one hundred five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •