Base | Representation |
---|---|
bin | 1100000110010010111110… |
… | …0001011100101101111001 |
3 | 1202002200120221000012012121 |
4 | 3001210233201130231321 |
5 | 3220421113104410431 |
6 | 44142555230441241 |
7 | 2542026444665005 |
oct | 301445741345571 |
9 | 52080527005177 |
10 | 13302311013241 |
11 | 426952985a498 |
12 | 15aa0b1063221 |
13 | 756530516c83 |
14 | 33db9a061705 |
15 | 181054b90611 |
hex | c192f85cb79 |
13302311013241 has 2 divisors, whose sum is σ = 13302311013242. Its totient is φ = 13302311013240.
The previous prime is 13302311013221. The next prime is 13302311013247. The reversal of 13302311013241 is 14231011320331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13048017737616 + 254293275625 = 3612204^2 + 504275^2 .
It is a cyclic number.
It is not a de Polignac number, because 13302311013241 - 211 = 13302311011193 is a prime.
It is not a weakly prime, because it can be changed into another prime (13302311013247) 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, 6651155506620 + 6651155506621.
It is an arithmetic number, because the mean of its divisors is an integer number (6651155506621).
Almost surely, 213302311013241 is an apocalyptic number.
It is an amenable number.
13302311013241 is a deficient number, since it is larger than the sum of its proper divisors (1).
13302311013241 is an equidigital number, since it uses as much as digits as its factorization.
13302311013241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 13302311013241 its reverse (14231011320331), we get a palindrome (27533322333572).
The spelling of 13302311013241 in words is "thirteen trillion, three hundred two billion, three hundred eleven million, thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •