Base | Representation |
---|---|
bin | 10000111100001… |
… | …01100111010001 |
3 | 100220101200110200 |
4 | 20132011213101 |
5 | 242334330131 |
6 | 22033445413 |
7 | 3343605261 |
oct | 1036054721 |
9 | 326350420 |
10 | 142105041 |
11 | 7323a691 |
12 | 3b710869 |
13 | 23596530 |
14 | 14c317a1 |
15 | c7202e6 |
hex | 87859d1 |
142105041 has 12 divisors (see below), whose sum is σ = 221052468. Its totient is φ = 87449184.
The previous prime is 142105021. The next prime is 142105079. The reversal of 142105041 is 140501241.
It can be written as a sum of positive squares in 2 ways, for example, as 96825600 + 45279441 = 9840^2 + 6729^2 .
It is not a de Polignac number, because 142105041 - 213 = 142096849 is a prime.
It is a super-2 number, since 2×1421050412 = 40387685355223362, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (142105021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 607170 + ... + 607403.
It is an arithmetic number, because the mean of its divisors is an integer number (18421039).
Almost surely, 2142105041 is an apocalyptic number.
It is an amenable number.
142105041 is a deficient number, since it is larger than the sum of its proper divisors (78947427).
142105041 is a wasteful number, since it uses less digits than its factorization.
142105041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1214592 (or 1214589 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 142105041 is about 11920.7818954966. The cubic root of 142105041 is about 521.8389537105.
Adding to 142105041 its reverse (140501241), we get a palindrome (282606282).
The spelling of 142105041 in words is "one hundred forty-two million, one hundred five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •