Base | Representation |
---|---|
bin | 1000010001000100101… |
… | …1011110110000110111 |
3 | 111120120202201101111112 |
4 | 2010101023132300313 |
5 | 4311330132034111 |
6 | 145124415225235 |
7 | 13155304204016 |
oct | 2042113366067 |
9 | 446522641445 |
10 | 142022143031 |
11 | 5525a88512a |
12 | 23636b1821b |
13 | 105147c0032 |
14 | 6c3400ca7d |
15 | 3a63509e8b |
hex | 21112dec37 |
142022143031 has 8 divisors (see below), whose sum is σ = 143845390080. Its totient is φ = 140201566072.
The previous prime is 142022143013. The next prime is 142022143051. The reversal of 142022143031 is 130341220241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142022143031 is a prime.
It is a super-2 number, since 2×1420221430312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142022142988 and 142022143006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142022143051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 560351 + ... + 773328.
It is an arithmetic number, because the mean of its divisors is an integer number (17980673760).
Almost surely, 2142022143031 is an apocalyptic number.
142022143031 is a deficient number, since it is larger than the sum of its proper divisors (1823247049).
142022143031 is a wasteful number, since it uses less digits than its factorization.
142022143031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1335045.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 142022143031 its reverse (130341220241), we get a palindrome (272363363272).
The spelling of 142022143031 in words is "one hundred forty-two billion, twenty-two million, one hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •