Base | Representation |
---|---|
bin | 11000011010000000… |
… | …11001110101110111 |
3 | 1020211011211000220112 |
4 | 30031000121311313 |
5 | 203313344032133 |
6 | 10004113053235 |
7 | 642464416244 |
oct | 141500316567 |
9 | 36734730815 |
10 | 13103111543 |
11 | 5614401705 |
12 | 265825721b |
13 | 130a864852 |
14 | 8c432a5cb |
15 | 51a51d648 |
hex | 30d019d77 |
13103111543 has 8 divisors (see below), whose sum is σ = 13303770240. Its totient is φ = 12902602680.
The previous prime is 13103111533. The next prime is 13103111603. The reversal of 13103111543 is 34511130131.
13103111543 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13103111543 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 (13103111503) 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, 145568 + ... + 217706.
It is an arithmetic number, because the mean of its divisors is an integer number (1662971280).
Almost surely, 213103111543 is an apocalyptic number.
13103111543 is a deficient number, since it is larger than the sum of its proper divisors (200658697).
13103111543 is an equidigital number, since it uses as much as digits as its factorization.
13103111543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74917.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 13103111543 its reverse (34511130131), we get a palindrome (47614241674).
The spelling of 13103111543 in words is "thirteen billion, one hundred three million, one hundred eleven thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •