Base | Representation |
---|---|
bin | 10000111110000… |
… | …00010100111101 |
3 | 100220211220100210 |
4 | 20133000110331 |
5 | 242420024113 |
6 | 22042543033 |
7 | 3345626361 |
oct | 1037002475 |
9 | 326756323 |
10 | 142345533 |
11 | 73394340 |
12 | 3b807a79 |
13 | 2364bb35 |
14 | 14c952a1 |
15 | c76b6c3 |
hex | 87c053d |
142345533 has 8 divisors (see below), whose sum is σ = 207048096. Its totient is φ = 86270000.
The previous prime is 142345531. The next prime is 142345561. The reversal of 142345533 is 335543241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142345533 - 21 = 142345531 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 142345533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142345531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2156718 + ... + 2156783.
It is an arithmetic number, because the mean of its divisors is an integer number (25881012).
Almost surely, 2142345533 is an apocalyptic number.
It is an amenable number.
142345533 is a deficient number, since it is larger than the sum of its proper divisors (64702563).
142345533 is a wasteful number, since it uses less digits than its factorization.
142345533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4313515.
The product of its digits is 21600, while the sum is 30.
The square root of 142345533 is about 11930.8647213855. The cubic root of 142345533 is about 522.1331665067.
Adding to 142345533 its reverse (335543241), we get a palindrome (477888774).
The spelling of 142345533 in words is "one hundred forty-two million, three hundred forty-five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.780 sec. • engine limits •