Base | Representation |
---|---|
bin | 1100000110110011011111… |
… | …1000101010110010010101 |
3 | 1202010112010100111022001102 |
4 | 3001230313320222302111 |
5 | 3221042003030040001 |
6 | 44151001414035445 |
7 | 2542456003542416 |
oct | 301546770526225 |
9 | 52115110438042 |
10 | 13311041252501 |
11 | 42721a9850463 |
12 | 15ab928948b85 |
13 | 7572c2126315 |
14 | 3403876d580d |
15 | 1813b6332e6b |
hex | c1b37e2ac95 |
13311041252501 has 2 divisors, whose sum is σ = 13311041252502. Its totient is φ = 13311041252500.
The previous prime is 13311041252477. The next prime is 13311041252513. The reversal of 13311041252501 is 10525214011331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13294767147601 + 16274104900 = 3646199^2 + 127570^2 .
It is a cyclic number.
It is not a de Polignac number, because 13311041252501 - 226 = 13310974143637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13311041282501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655520626250 + 6655520626251.
It is an arithmetic number, because the mean of its divisors is an integer number (6655520626251).
Almost surely, 213311041252501 is an apocalyptic number.
It is an amenable number.
13311041252501 is a deficient number, since it is larger than the sum of its proper divisors (1).
13311041252501 is an equidigital number, since it uses as much as digits as its factorization.
13311041252501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 13311041252501 its reverse (10525214011331), we get a palindrome (23836255263832).
The spelling of 13311041252501 in words is "thirteen trillion, three hundred eleven billion, forty-one million, two hundred fifty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •