Base | Representation |
---|---|
bin | 110000000001110111… |
… | …1100000011000001111 |
3 | 100212020010212111011101 |
4 | 1200003233200120033 |
5 | 3142213323001033 |
6 | 115214403003531 |
7 | 10310645351530 |
oct | 1400357403017 |
9 | 325203774141 |
10 | 103142000143 |
11 | 3a818a74336 |
12 | 17ba60695a7 |
13 | 9959751820 |
14 | 4dc646c687 |
15 | 2a39ecc97d |
hex | 1803be060f |
103142000143 has 16 divisors (see below), whose sum is σ = 134411296320. Its totient is φ = 76806452736.
The previous prime is 103142000131. The next prime is 103142000167. The reversal of 103142000143 is 341000241301.
It is not a de Polignac number, because 103142000143 - 25 = 103142000111 is a prime.
It is a super-2 number, since 2×1031420001432 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103142000143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103142000123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33334588 + ... + 33337681.
It is an arithmetic number, because the mean of its divisors is an integer number (8400706020).
Almost surely, 2103142000143 is an apocalyptic number.
103142000143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
103142000143 is a deficient number, since it is larger than the sum of its proper divisors (31269296177).
103142000143 is a wasteful number, since it uses less digits than its factorization.
103142000143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66672306.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 103142000143 its reverse (341000241301), we get a palindrome (444142241444).
The spelling of 103142000143 in words is "one hundred three billion, one hundred forty-two million, one hundred forty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •