Base | Representation |
---|---|
bin | 1011111010101100100001… |
… | …0101000100101010010001 |
3 | 1201101122011101021200222001 |
4 | 2332223020111010222101 |
5 | 3204134431333020423 |
6 | 43511235032314001 |
7 | 2521442555463313 |
oct | 276531025045221 |
9 | 51348141250861 |
10 | 13103011220113 |
11 | 41a1a5726a061 |
12 | 157754bb42901 |
13 | 7407bb2aa3b9 |
14 | 334290d6d7b3 |
15 | 17ac8ce2ecad |
hex | beac8544a91 |
13103011220113 has 8 divisors (see below), whose sum is σ = 13883094125640. Its totient is φ = 12323963596800.
The previous prime is 13103011220093. The next prime is 13103011220153. The reversal of 13103011220113 is 31102211030131.
It can be written as a sum of positive squares in 4 ways, for example, as 293999275089 + 12809011945024 = 542217^2 + 3578968^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13103011220113 - 237 = 12965572266641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13103011220153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 258794488 + ... + 258845113.
It is an arithmetic number, because the mean of its divisors is an integer number (1735386765705).
Almost surely, 213103011220113 is an apocalyptic number.
It is an amenable number.
13103011220113 is a deficient number, since it is larger than the sum of its proper divisors (780082905527).
13103011220113 is a wasteful number, since it uses less digits than its factorization.
13103011220113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 517641107.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13103011220113 its reverse (31102211030131), we get a palindrome (44205222250244).
The spelling of 13103011220113 in words is "thirteen trillion, one hundred three billion, eleven million, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •