Base | Representation |
---|---|
bin | 1100000111100000011111… |
… | …1010011110011001000001 |
3 | 1202011200022020021101110201 |
4 | 3001320013322132121001 |
5 | 3221241223024242122 |
6 | 44200320223525201 |
7 | 2543364236460526 |
oct | 301700772363101 |
9 | 52150266241421 |
10 | 13323121321537 |
11 | 4277338720095 |
12 | 15b213a459801 |
13 | 758498a43771 |
14 | 340bb1bd714d |
15 | 181871b1ca27 |
hex | c1e07e9e641 |
13323121321537 has 2 divisors, whose sum is σ = 13323121321538. Its totient is φ = 13323121321536.
The previous prime is 13323121321511. The next prime is 13323121321561. The reversal of 13323121321537 is 73512312132331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10090590611761 + 3232530709776 = 3176569^2 + 1797924^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13323121321537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13323121321496 and 13323121321505.
It is not a weakly prime, because it can be changed into another prime (13323121321567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6661560660768 + 6661560660769.
It is an arithmetic number, because the mean of its divisors is an integer number (6661560660769).
Almost surely, 213323121321537 is an apocalyptic number.
It is an amenable number.
13323121321537 is a deficient number, since it is larger than the sum of its proper divisors (1).
13323121321537 is an equidigital number, since it uses as much as digits as its factorization.
13323121321537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 68040, while the sum is 37.
Adding to 13323121321537 its reverse (73512312132331), we get a palindrome (86835433453868).
The spelling of 13323121321537 in words is "thirteen trillion, three hundred twenty-three billion, one hundred twenty-one million, three hundred twenty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •