Base | Representation |
---|---|
bin | 1100000111111111011000… |
… | …1001100110111001010001 |
3 | 1202012110201002222010221022 |
4 | 3001333312021212321101 |
5 | 3221410213241430413 |
6 | 44204211112205225 |
7 | 2544106563532304 |
oct | 301776611467121 |
9 | 52173632863838 |
10 | 13331413233233 |
11 | 427a903248077 |
12 | 15b3873399815 |
13 | 7591ba8b1ca4 |
14 | 34135b16ab3b |
15 | 181ba9a7a608 |
hex | c1ff6266e51 |
13331413233233 has 2 divisors, whose sum is σ = 13331413233234. Its totient is φ = 13331413233232.
The previous prime is 13331413233169. The next prime is 13331413233247. The reversal of 13331413233233 is 33233231413331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8844336967249 + 4487076265984 = 2973943^2 + 2118272^2 .
It is a cyclic number.
It is not a de Polignac number, because 13331413233233 - 26 = 13331413233169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13331413233193 and 13331413233202.
It is not a weakly prime, because it can be changed into another prime (13331413233263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6665706616616 + 6665706616617.
It is an arithmetic number, because the mean of its divisors is an integer number (6665706616617).
Almost surely, 213331413233233 is an apocalyptic number.
It is an amenable number.
13331413233233 is a deficient number, since it is larger than the sum of its proper divisors (1).
13331413233233 is an equidigital number, since it uses as much as digits as its factorization.
13331413233233 is an evil number, because the sum of its binary digits is even.
The product of its digits is 104976, while the sum is 35.
Adding to 13331413233233 its reverse (33233231413331), we get a palindrome (46564644646564).
The spelling of 13331413233233 in words is "thirteen trillion, three hundred thirty-one billion, four hundred thirteen million, two hundred thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •