Base | Representation |
---|---|
bin | 1001011111110001110100… |
… | …1111111101110111111001 |
3 | 1100222012111000011101210112 |
4 | 2113330131033331313321 |
5 | 2332033301343041213 |
6 | 34112441255154105 |
7 | 2125243332322661 |
oct | 227743517756771 |
9 | 40865430141715 |
10 | 10441556221433 |
11 | 336626a304677 |
12 | 1207788075935 |
13 | 5a98330944ac |
14 | 2815344391a1 |
15 | 13191ec75ea8 |
hex | 97f1d3fddf9 |
10441556221433 has 2 divisors, whose sum is σ = 10441556221434. Its totient is φ = 10441556221432.
The previous prime is 10441556221429. The next prime is 10441556221489. The reversal of 10441556221433 is 33412265514401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7775023987129 + 2666532234304 = 2788373^2 + 1632952^2 .
It is an emirp because it is prime and its reverse (33412265514401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10441556221433 - 22 = 10441556221429 is a prime.
It is not a weakly prime, because it can be changed into another prime (10441556211433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5220778110716 + 5220778110717.
It is an arithmetic number, because the mean of its divisors is an integer number (5220778110717).
Almost surely, 210441556221433 is an apocalyptic number.
It is an amenable number.
10441556221433 is a deficient number, since it is larger than the sum of its proper divisors (1).
10441556221433 is an equidigital number, since it uses as much as digits as its factorization.
10441556221433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 345600, while the sum is 41.
The spelling of 10441556221433 in words is "ten trillion, four hundred forty-one billion, five hundred fifty-six million, two hundred twenty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •