Base | Representation |
---|---|
bin | 10000111100011… |
… | …00010000000111 |
3 | 100220110001202201 |
4 | 20132030100013 |
5 | 242341212411 |
6 | 22034215331 |
7 | 3344050453 |
oct | 1036142007 |
9 | 326401681 |
10 | 142132231 |
11 | 7325905a |
12 | 3b724547 |
13 | 235a5a17 |
14 | 14c3b663 |
15 | c7283c1 |
hex | 878c407 |
142132231 has 2 divisors, whose sum is σ = 142132232. Its totient is φ = 142132230.
The previous prime is 142132229. The next prime is 142132247. The reversal of 142132231 is 132231241.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 142132231 - 21 = 142132229 is a prime.
It is a super-2 number, since 2×1421322312 = 40403142178074722, which contains 22 as substring.
Together with 142132229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 142132199 and 142132208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142132261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71066115 + 71066116.
It is an arithmetic number, because the mean of its divisors is an integer number (71066116).
Almost surely, 2142132231 is an apocalyptic number.
142132231 is a deficient number, since it is larger than the sum of its proper divisors (1).
142132231 is an equidigital number, since it uses as much as digits as its factorization.
142132231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 288, while the sum is 19.
The square root of 142132231 is about 11921.9222862758. The cubic root of 142132231 is about 521.8722340131.
Adding to 142132231 its reverse (132231241), we get a palindrome (274363472).
The spelling of 142132231 in words is "one hundred forty-two million, one hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •