Base | Representation |
---|---|
bin | 11000011010000000… |
… | …00010000111000101 |
3 | 1020211011122002120110 |
4 | 30031000002013011 |
5 | 203313332424331 |
6 | 10004111023233 |
7 | 642463532664 |
oct | 141500020705 |
9 | 36734562513 |
10 | 13103014341 |
11 | 561434567a |
12 | 265820ab19 |
13 | 130a82c531 |
14 | 8c4302ddb |
15 | 51a4ee946 |
hex | 30d0021c5 |
13103014341 has 4 divisors (see below), whose sum is σ = 17470685792. Its totient is φ = 8735342892.
The previous prime is 13103014321. The next prime is 13103014343. The reversal of 13103014341 is 14341030131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14341030131 = 3 ⋅4780343377.
It is not a de Polignac number, because 13103014341 - 213 = 13103006149 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 (13103014343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2183835721 + ... + 2183835726.
It is an arithmetic number, because the mean of its divisors is an integer number (4367671448).
Almost surely, 213103014341 is an apocalyptic number.
It is an amenable number.
13103014341 is a deficient number, since it is larger than the sum of its proper divisors (4367671451).
13103014341 is an equidigital number, since it uses as much as digits as its factorization.
13103014341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4367671450.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13103014341 its reverse (14341030131), we get a palindrome (27444044472).
The spelling of 13103014341 in words is "thirteen billion, one hundred three million, fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •