Base | Representation |
---|---|
bin | 10001000011110… |
… | …01000010011010 |
3 | 100222021100012000 |
4 | 20201321002122 |
5 | 243113231411 |
6 | 22111101430 |
7 | 3355230210 |
oct | 1041710232 |
9 | 328240160 |
10 | 143102106 |
11 | 73860804 |
12 | 3bb11876 |
13 | 23855304 |
14 | 15010cb0 |
15 | c86a956 |
hex | 887909a |
143102106 has 64 divisors (see below), whose sum is σ = 364815360. Its totient is φ = 40731120.
The previous prime is 143102093. The next prime is 143102111. The reversal of 143102106 is 601201341.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 130621 + ... + 131711.
It is an arithmetic number, because the mean of its divisors is an integer number (5700240).
Almost surely, 2143102106 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 143102106, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182407680).
143102106 is an abundant number, since it is smaller than the sum of its proper divisors (221713254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143102106 is a wasteful number, since it uses less digits than its factorization.
143102106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1456 (or 1450 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 143102106 is about 11962.5292476131. The cubic root of 143102106 is about 523.0565862923.
Adding to 143102106 its reverse (601201341), we get a palindrome (744303447).
The spelling of 143102106 in words is "one hundred forty-three million, one hundred two thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •