Base | Representation |
---|---|
bin | 110000001101100011… |
… | …1010000101001100111 |
3 | 100220020110200101100201 |
4 | 1200123013100221213 |
5 | 3144014212300033 |
6 | 115321331051331 |
7 | 10323446233132 |
oct | 1403307205147 |
9 | 326213611321 |
10 | 103534103143 |
11 | 3a9aa3360a9 |
12 | 18095440b47 |
13 | 99bca59833 |
14 | 5022579219 |
15 | 2a5e63147d |
hex | 181b1d0a67 |
103534103143 has 4 divisors (see below), whose sum is σ = 103617802120. Its totient is φ = 103450404168.
The previous prime is 103534103129. The next prime is 103534103203. The reversal of 103534103143 is 341301435301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341301435301 = 5303 ⋅64360067.
It is a cyclic number.
It is not a de Polignac number, because 103534103143 - 233 = 94944168551 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103534103243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41847633 + ... + 41850106.
It is an arithmetic number, because the mean of its divisors is an integer number (25904450530).
Almost surely, 2103534103143 is an apocalyptic number.
103534103143 is a deficient number, since it is larger than the sum of its proper divisors (83698977).
103534103143 is an equidigital number, since it uses as much as digits as its factorization.
103534103143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83698976.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 103534103143 its reverse (341301435301), we get a palindrome (444835538444).
The spelling of 103534103143 in words is "one hundred three billion, five hundred thirty-four million, one hundred three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •