Base | Representation |
---|---|
bin | 10000111011100… |
… | …01110000110011 |
3 | 100220020112221012 |
4 | 20131301300303 |
5 | 242324224411 |
6 | 22032021135 |
7 | 3343116233 |
oct | 1035616063 |
9 | 326215835 |
10 | 142023731 |
11 | 73194593 |
12 | 3b6917ab |
13 | 23568515 |
14 | 14c0dcc3 |
15 | c70618b |
hex | 8771c33 |
142023731 has 2 divisors, whose sum is σ = 142023732. Its totient is φ = 142023730.
The previous prime is 142023709. The next prime is 142023733. The reversal of 142023731 is 137320241.
142023731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142023731 is a prime.
It is a super-2 number, since 2×1420237312 = 40341480334320722, which contains 22 as substring.
Together with 142023733, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 142023697 and 142023706.
It is not a weakly prime, because it can be changed into another prime (142023733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71011865 + 71011866.
It is an arithmetic number, because the mean of its divisors is an integer number (71011866).
Almost surely, 2142023731 is an apocalyptic number.
142023731 is a deficient number, since it is larger than the sum of its proper divisors (1).
142023731 is an equidigital number, since it uses as much as digits as its factorization.
142023731 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1008, while the sum is 23.
The square root of 142023731 is about 11917.3709768556. The cubic root of 142023731 is about 521.7394057041.
Adding to 142023731 its reverse (137320241), we get a palindrome (279343972).
The spelling of 142023731 in words is "one hundred forty-two million, twenty-three thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •