Base | Representation |
---|---|
bin | 1011111010101100111011… |
… | …1001000100110000110101 |
3 | 1201101122110001110102000011 |
4 | 2332223032321010300311 |
5 | 3204140143024233023 |
6 | 43511254004220221 |
7 | 2521445363355223 |
oct | 276531671046065 |
9 | 51348401412004 |
10 | 13103121321013 |
11 | 41a200342a539 |
12 | 157758099a671 |
13 | 740808049669 |
14 | 3342a182db13 |
15 | 17ac9792c50d |
hex | beacee44c35 |
13103121321013 has 2 divisors, whose sum is σ = 13103121321014. Its totient is φ = 13103121321012.
The previous prime is 13103121320951. The next prime is 13103121321053. The reversal of 13103121321013 is 31012312130131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8579872856164 + 4523248464849 = 2929142^2 + 2126793^2 .
It is an emirp because it is prime and its reverse (31012312130131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13103121321013 - 241 = 10904098065461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13103121321053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551560660506 + 6551560660507.
It is an arithmetic number, because the mean of its divisors is an integer number (6551560660507).
Almost surely, 213103121321013 is an apocalyptic number.
It is an amenable number.
13103121321013 is a deficient number, since it is larger than the sum of its proper divisors (1).
13103121321013 is an equidigital number, since it uses as much as digits as its factorization.
13103121321013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13103121321013 its reverse (31012312130131), we get a palindrome (44115433451144).
The spelling of 13103121321013 in words is "thirteen trillion, one hundred three billion, one hundred twenty-one million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •