Base | Representation |
---|---|
bin | 10111100001010010110101… |
… | …011101000111000011001101 |
3 | 111120021001120002020020010122 |
4 | 113201102311131013003031 |
5 | 102024302314341222023 |
6 | 1004001024111314325 |
7 | 30534340610666114 |
oct | 2741226535070315 |
9 | 446231502206118 |
10 | 103443036664013 |
11 | 2aa61a44495972 |
12 | b727b5381b9a5 |
13 | 4594837517237 |
14 | 1b789538a6c7b |
15 | be5bcdccb2c8 |
hex | 5e14b57470cd |
103443036664013 has 4 divisors (see below), whose sum is σ = 103443137552988. Its totient is φ = 103442935775040.
The previous prime is 103443036664001. The next prime is 103443036664139. The reversal of 103443036664013 is 310466630344301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 100379619595369 + 3063417068644 = 10018963^2 + 1750262^2 .
It is a cyclic number.
It is not a de Polignac number, because 103443036664013 - 212 = 103443036659917 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 (103443036669013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48890558 + ... + 50962463.
It is an arithmetic number, because the mean of its divisors is an integer number (25860784388247).
Almost surely, 2103443036664013 is an apocalyptic number.
It is an amenable number.
103443036664013 is a deficient number, since it is larger than the sum of its proper divisors (100888975).
103443036664013 is an equidigital number, since it uses as much as digits as its factorization.
103443036664013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100888974.
The product of its (nonzero) digits is 1119744, while the sum is 44.
The spelling of 103443036664013 in words is "one hundred three trillion, four hundred forty-three billion, thirty-six million, six hundred sixty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •