Base | Representation |
---|---|
bin | 101111111101111111… |
… | …1111111011111001111 |
3 | 100211220002110002100102 |
4 | 1133323333333133033 |
5 | 3141432044313033 |
6 | 115153442521315 |
7 | 10304510303144 |
oct | 1377377773717 |
9 | 324802402312 |
10 | 103012104143 |
11 | 3a761713573 |
12 | 17b6a66623b |
13 | 99388714a0 |
14 | 4db30d83cb |
15 | 2a2d8bede8 |
hex | 17fbfff7cf |
103012104143 has 4 divisors (see below), whose sum is σ = 110936112168. Its totient is φ = 95088096120.
The previous prime is 103012104127. The next prime is 103012104179. The reversal of 103012104143 is 341401210301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103012104143 - 24 = 103012104127 is a prime.
It is a super-2 number, since 2×1030121041432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103012104103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3962003993 + ... + 3962004018.
It is an arithmetic number, because the mean of its divisors is an integer number (27734028042).
Almost surely, 2103012104143 is an apocalyptic number.
103012104143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
103012104143 is a deficient number, since it is larger than the sum of its proper divisors (7924008025).
103012104143 is an equidigital number, since it uses as much as digits as its factorization.
103012104143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7924008024.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 103012104143 its reverse (341401210301), we get a palindrome (444413314444).
The spelling of 103012104143 in words is "one hundred three billion, twelve million, one hundred four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •