Base | Representation |
---|---|
bin | 1100000110110000000111… |
… | …0000011000010111011001 |
3 | 1202010102210001122220001121 |
4 | 3001230001300120113121 |
5 | 3221033123034011413 |
6 | 44150331333245241 |
7 | 2542424335502341 |
oct | 301540160302731 |
9 | 52112701586047 |
10 | 13310133110233 |
11 | 4271883167763 |
12 | 15ab714793821 |
13 | 7571a8c3b82b |
14 | 3402dcc59d21 |
15 | 181361748b8d |
hex | c1b01c185d9 |
13310133110233 has 2 divisors, whose sum is σ = 13310133110234. Its totient is φ = 13310133110232.
The previous prime is 13310133110227. The next prime is 13310133110237. The reversal of 13310133110233 is 33201133101331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13269430854729 + 40702255504 = 3642723^2 + 201748^2 .
It is a cyclic number.
It is not a de Polignac number, because 13310133110233 - 241 = 11111109854681 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13310133110198 and 13310133110207.
It is not a weakly prime, because it can be changed into another prime (13310133110237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655066555116 + 6655066555117.
It is an arithmetic number, because the mean of its divisors is an integer number (6655066555117).
Almost surely, 213310133110233 is an apocalyptic number.
It is an amenable number.
13310133110233 is a deficient number, since it is larger than the sum of its proper divisors (1).
13310133110233 is an equidigital number, since it uses as much as digits as its factorization.
13310133110233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 13310133110233 its reverse (33201133101331), we get a palindrome (46511266211564).
The spelling of 13310133110233 in words is "thirteen trillion, three hundred ten billion, one hundred thirty-three million, one hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •