Base | Representation |
---|---|
bin | 1000010010001110100… |
… | …1111111011011001101 |
3 | 111121101101000102002012 |
4 | 2010203221333123031 |
5 | 4312444011143041 |
6 | 145215251311005 |
7 | 13166060103053 |
oct | 2044351773315 |
9 | 447341012065 |
10 | 142332131021 |
11 | 553a9860753 |
12 | 237028ab465 |
13 | 10563aa7092 |
14 | 6c632621d3 |
15 | 3a8083d3eb |
hex | 2123a7f6cd |
142332131021 has 4 divisors (see below), whose sum is σ = 142469121600. Its totient is φ = 142195140444.
The previous prime is 142332131009. The next prime is 142332131023. The reversal of 142332131021 is 120131233241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 142332131021 - 226 = 142265022157 is a prime.
It is a super-2 number, since 2×1423321310212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142332131023) 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, 68493731 + ... + 68495808.
It is an arithmetic number, because the mean of its divisors is an integer number (35617280400).
Almost surely, 2142332131021 is an apocalyptic number.
It is an amenable number.
142332131021 is a deficient number, since it is larger than the sum of its proper divisors (136990579).
142332131021 is a wasteful number, since it uses less digits than its factorization.
142332131021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136990578.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 142332131021 its reverse (120131233241), we get a palindrome (262463364262).
The spelling of 142332131021 in words is "one hundred forty-two billion, three hundred thirty-two million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •