Base | Representation |
---|---|
bin | 1100001001001100000111… |
… | …1100100000100000010001 |
3 | 1202021102212200121010011011 |
4 | 3002103001330200200101 |
5 | 3222224410112023213 |
6 | 44221455120050521 |
7 | 2545436211166465 |
oct | 302230174404021 |
9 | 52242780533134 |
10 | 13352012220433 |
11 | 42886138a3037 |
12 | 15b7861a63a41 |
13 | 75b1213bc503 |
14 | 342352c144a5 |
15 | 1824b31b403d |
hex | c24c1f20811 |
13352012220433 has 2 divisors, whose sum is σ = 13352012220434. Its totient is φ = 13352012220432.
The previous prime is 13352012220329. The next prime is 13352012220467. The reversal of 13352012220433 is 33402221025331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12793333707729 + 558678512704 = 3576777^2 + 747448^2 .
It is a cyclic number.
It is not a de Polignac number, because 13352012220433 - 225 = 13351978666001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13352012220395 and 13352012220404.
It is not a weakly prime, because it can be changed into another prime (13352012200433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6676006110216 + 6676006110217.
It is an arithmetic number, because the mean of its divisors is an integer number (6676006110217).
Almost surely, 213352012220433 is an apocalyptic number.
It is an amenable number.
13352012220433 is a deficient number, since it is larger than the sum of its proper divisors (1).
13352012220433 is an equidigital number, since it uses as much as digits as its factorization.
13352012220433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 13352012220433 its reverse (33402221025331), we get a palindrome (46754233245764).
The spelling of 13352012220433 in words is "thirteen trillion, three hundred fifty-two billion, twelve million, two hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •