Base | Representation |
---|---|
bin | 1100000111010110011110… |
… | …1111010001111011010001 |
3 | 1202011102100221122221201002 |
4 | 3001311213233101323101 |
5 | 3221220222103013322 |
6 | 44155153425551345 |
7 | 2543240526054245 |
oct | 301654757217321 |
9 | 52142327587632 |
10 | 13320434032337 |
11 | 4276189825a23 |
12 | 15b170a4a5555 |
13 | 75815b08a703 |
14 | 3409d8d52425 |
15 | 181765c48c92 |
hex | c1d67bd1ed1 |
13320434032337 has 2 divisors, whose sum is σ = 13320434032338. Its totient is φ = 13320434032336.
The previous prime is 13320434032291. The next prime is 13320434032361. The reversal of 13320434032337 is 73323043402331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13310173152721 + 10260879616 = 3648311^2 + 101296^2 .
It is a cyclic number.
It is not a de Polignac number, because 13320434032337 - 220 = 13320432983761 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13320434032337.
It is not a weakly prime, because it can be changed into another prime (13320434032837) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660217016168 + 6660217016169.
It is an arithmetic number, because the mean of its divisors is an integer number (6660217016169).
Almost surely, 213320434032337 is an apocalyptic number.
It is an amenable number.
13320434032337 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320434032337 is an equidigital number, since it uses as much as digits as its factorization.
13320434032337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 326592, while the sum is 38.
Adding to 13320434032337 its reverse (73323043402331), we get a palindrome (86643477434668).
The spelling of 13320434032337 in words is "thirteen trillion, three hundred twenty billion, four hundred thirty-four million, thirty-two thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •