Base | Representation |
---|---|
bin | 1011010111101001… |
… | …00010101110100111 |
3 | 120202101120101222210 |
4 | 11223310202232213 |
5 | 100000044400033 |
6 | 2445403454503 |
7 | 304155214662 |
oct | 55364425647 |
9 | 16671511883 |
10 | 6103903143 |
11 | 2652548858 |
12 | 1224227433 |
13 | 763778010 |
14 | 41c9386d9 |
15 | 25ad0dd63 |
hex | 16bd22ba7 |
6103903143 has 8 divisors (see below), whose sum is σ = 8764578928. Its totient is φ = 3756248064.
The previous prime is 6103903129. The next prime is 6103903199. The reversal of 6103903143 is 3413093016.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6103903143 - 212 = 6103899047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6103903143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6103903123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78255130 + ... + 78255207.
It is an arithmetic number, because the mean of its divisors is an integer number (1095572366).
Almost surely, 26103903143 is an apocalyptic number.
6103903143 is a deficient number, since it is larger than the sum of its proper divisors (2660675785).
6103903143 is a wasteful number, since it uses less digits than its factorization.
6103903143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156510353.
The product of its (nonzero) digits is 5832, while the sum is 30.
The square root of 6103903143 is about 78127.4800758350. The cubic root of 6103903143 is about 1827.5497623690.
Adding to 6103903143 its reverse (3413093016), we get a palindrome (9516996159).
The spelling of 6103903143 in words is "six billion, one hundred three million, nine hundred three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •