Base | Representation |
---|---|
bin | 1000010001000100011… |
… | …1101000011011011001 |
3 | 111120120200211010102112 |
4 | 2010101013220123121 |
5 | 4311324402242131 |
6 | 145124341442105 |
7 | 13155262502243 |
oct | 2042107503331 |
9 | 446520733375 |
10 | 142021134041 |
11 | 5525a256056 |
12 | 23636710335 |
13 | 105145289b7 |
14 | 6c33c29093 |
15 | 3a633ab02b |
hex | 21111e86d9 |
142021134041 has 4 divisors (see below), whose sum is σ = 142128645684. Its totient is φ = 141913622400.
The previous prime is 142021134023. The next prime is 142021134049. The reversal of 142021134041 is 140431120241.
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 137638032016 + 4383102025 = 370996^2 + 66205^2 .
It is a cyclic number.
It is not a de Polignac number, because 142021134041 - 214 = 142021117657 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142021133998 and 142021134016.
It is not an unprimeable number, because it can be changed into a prime (142021134049) 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, 53753840 + ... + 53756481.
It is an arithmetic number, because the mean of its divisors is an integer number (35532161421).
Almost surely, 2142021134041 is an apocalyptic number.
It is an amenable number.
142021134041 is a deficient number, since it is larger than the sum of its proper divisors (107511643).
142021134041 is a wasteful number, since it uses less digits than its factorization.
142021134041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107511642.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 142021134041 its reverse (140431120241), we get a palindrome (282452254282).
The spelling of 142021134041 in words is "one hundred forty-two billion, twenty-one million, one hundred thirty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •