Base | Representation |
---|---|
bin | 1100000110001110011110… |
… | …0001101101101001000101 |
3 | 1202002120110202011000022111 |
4 | 3001203213201231221011 |
5 | 3220411124344414023 |
6 | 44142235321301021 |
7 | 2541654510045106 |
oct | 301434741555105 |
9 | 52076422130274 |
10 | 13301103123013 |
11 | 4268a69a54702 |
12 | 15a9a14634771 |
13 | 75639a1bc324 |
14 | 33dac387a3ad |
15 | 180ed3ae700d |
hex | c18e786da45 |
13301103123013 has 2 divisors, whose sum is σ = 13301103123014. Its totient is φ = 13301103123012.
The previous prime is 13301103123001. The next prime is 13301103123031. The reversal of 13301103123013 is 31032130110331.
Together with next prime (13301103123031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11005096316449 + 2296006806564 = 3317393^2 + 1515258^2 .
It is a cyclic number.
It is not a de Polignac number, because 13301103123013 - 213 = 13301103114821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13301103123313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650551561506 + 6650551561507.
It is an arithmetic number, because the mean of its divisors is an integer number (6650551561507).
Almost surely, 213301103123013 is an apocalyptic number.
It is an amenable number.
13301103123013 is a deficient number, since it is larger than the sum of its proper divisors (1).
13301103123013 is an equidigital number, since it uses as much as digits as its factorization.
13301103123013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 13301103123013 its reverse (31032130110331), we get a palindrome (44333233233344).
The spelling of 13301103123013 in words is "thirteen trillion, three hundred one billion, one hundred three million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •