Base | Representation |
---|---|
bin | 110000001000001010… |
… | …0110111010110001111 |
3 | 100212202212010111100122 |
4 | 1200100110313112033 |
5 | 3143131344321033 |
6 | 115251344015155 |
7 | 10316121011660 |
oct | 1402024672617 |
9 | 325685114318 |
10 | 103353120143 |
11 | 3a917161979 |
12 | 180449014bb |
13 | 99914003c0 |
14 | 5006507367 |
15 | 2a4d7d1a98 |
hex | 181053758f |
103353120143 has 8 divisors (see below), whose sum is σ = 127203840288. Its totient is φ = 81773897184.
The previous prime is 103353120139. The next prime is 103353120173. The reversal of 103353120143 is 341021353301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103353120143 - 22 = 103353120139 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103353120103) 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 7 ways as a sum of consecutive naturals, for example, 567874196 + ... + 567874377.
It is an arithmetic number, because the mean of its divisors is an integer number (15900480036).
Almost surely, 2103353120143 is an apocalyptic number.
103353120143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
103353120143 is a deficient number, since it is larger than the sum of its proper divisors (23850720145).
103353120143 is a wasteful number, since it uses less digits than its factorization.
103353120143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1135748593.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 103353120143 its reverse (341021353301), we get a palindrome (444374473444).
The spelling of 103353120143 in words is "one hundred three billion, three hundred fifty-three million, one hundred twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.230 sec. • engine limits •