Base | Representation |
---|---|
bin | 10001000010001… |
… | …01101001110001 |
3 | 100221212122110201 |
4 | 20201011221301 |
5 | 243040013013 |
6 | 22102355201 |
7 | 3353362453 |
oct | 1041055161 |
9 | 327778421 |
10 | 142891633 |
11 | 73727665 |
12 | 3ba2bb01 |
13 | 237b0581 |
14 | 14d982d3 |
15 | c8283dd |
hex | 8845a71 |
142891633 has 4 divisors (see below), whose sum is σ = 143028900. Its totient is φ = 142754368.
The previous prime is 142891631. The next prime is 142891667. The reversal of 142891633 is 336198241.
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 128663649 + 14227984 = 11343^2 + 3772^2 .
It is a cyclic number.
It is not a de Polignac number, because 142891633 - 21 = 142891631 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142891592 and 142891601.
It is not an unprimeable number, because it can be changed into a prime (142891631) 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 in 3 ways as a sum of consecutive naturals, for example, 67060 + ... + 69157.
It is an arithmetic number, because the mean of its divisors is an integer number (35757225).
Almost surely, 2142891633 is an apocalyptic number.
It is an amenable number.
142891633 is a deficient number, since it is larger than the sum of its proper divisors (137267).
142891633 is a wasteful number, since it uses less digits than its factorization.
142891633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137266.
The product of its digits is 31104, while the sum is 37.
The square root of 142891633 is about 11953.7288324606. The cubic root of 142891633 is about 522.8000251817.
The spelling of 142891633 in words is "one hundred forty-two million, eight hundred ninety-one thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •