Base | Representation |
---|---|
bin | 10001000111111… |
… | …00111000011110 |
3 | 101000021202222100 |
4 | 20203330320132 |
5 | 243233022032 |
6 | 22130425530 |
7 | 3362636520 |
oct | 1043747036 |
9 | 330252870 |
10 | 143642142 |
11 | 7409a516 |
12 | 401322a6 |
13 | 239b4067 |
14 | 15111a10 |
15 | c92597c |
hex | 88fce1e |
143642142 has 48 divisors (see below), whose sum is σ = 357039072. Its totient is φ = 40884480.
The previous prime is 143642141. The next prime is 143642179. The reversal of 143642142 is 241246341.
It is a happy number.
143642142 is a `hidden beast` number, since 1 + 4 + 3 + 642 + 14 + 2 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143642141) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 33378 + ... + 37434.
It is an arithmetic number, because the mean of its divisors is an integer number (7438314).
Almost surely, 2143642142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 143642142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178519536).
143642142 is an abundant number, since it is smaller than the sum of its proper divisors (213396930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143642142 is a wasteful number, since it uses less digits than its factorization.
143642142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4353 (or 4350 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
The square root of 143642142 is about 11985.0799747019. The cubic root of 143642142 is about 523.7137273407.
Adding to 143642142 its reverse (241246341), we get a palindrome (384888483).
The spelling of 143642142 in words is "one hundred forty-three million, six hundred forty-two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •