Base | Representation |
---|---|
bin | 1000010010100110001… |
… | …1101001010110100001 |
3 | 111121122021022010120121 |
4 | 2010221203221112201 |
5 | 4313144332143131 |
6 | 145233145240241 |
7 | 13201401431623 |
oct | 2045143512641 |
9 | 447567263517 |
10 | 142431131041 |
11 | 5544a729951 |
12 | 2372ba93081 |
13 | 1057b45a684 |
14 | 6c72472c13 |
15 | 3a89396911 |
hex | 21298e95a1 |
142431131041 has 4 divisors (see below), whose sum is σ = 142542668052. Its totient is φ = 142319594032.
The previous prime is 142431131039. The next prime is 142431131047. The reversal of 142431131041 is 140131134241.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 112667635600 + 29763495441 = 335660^2 + 172521^2 .
It is a cyclic number.
It is not a de Polignac number, because 142431131041 - 21 = 142431131039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142431130997 and 142431131015.
It is not an unprimeable number, because it can be changed into a prime (142431131047) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55766590 + ... + 55769143.
It is an arithmetic number, because the mean of its divisors is an integer number (35635667013).
Almost surely, 2142431131041 is an apocalyptic number.
It is an amenable number.
142431131041 is a deficient number, since it is larger than the sum of its proper divisors (111537011).
142431131041 is a wasteful number, since it uses less digits than its factorization.
142431131041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111537010.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 142431131041 its reverse (140131134241), we get a palindrome (282562265282).
The spelling of 142431131041 in words is "one hundred forty-two billion, four hundred thirty-one million, one hundred thirty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •