Base | Representation |
---|---|
bin | 11001000101011010011011… |
… | …000111001100110100010011 |
3 | 112110121210021210000110210102 |
4 | 121011122123013030310103 |
5 | 103430013233333233133 |
6 | 1030345425230523015 |
7 | 32144404031110355 |
oct | 3105323307146423 |
9 | 473553253013712 |
10 | 110323132321043 |
11 | 32174861093694 |
12 | 1045944196646b |
13 | 497357170b2a5 |
14 | 1d3594d3770d5 |
15 | cb4b57b1c7e8 |
hex | 64569b1ccd13 |
110323132321043 has 2 divisors, whose sum is σ = 110323132321044. Its totient is φ = 110323132321042.
The previous prime is 110323132321021. The next prime is 110323132321109. The reversal of 110323132321043 is 340123231323011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110323132321043 - 28 = 110323132320787 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 110323132320997 and 110323132321015.
It is not a weakly prime, because it can be changed into another prime (110323132321243) 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, 55161566160521 + 55161566160522.
It is an arithmetic number, because the mean of its divisors is an integer number (55161566160522).
Almost surely, 2110323132321043 is an apocalyptic number.
110323132321043 is a deficient number, since it is larger than the sum of its proper divisors (1).
110323132321043 is an equidigital number, since it uses as much as digits as its factorization.
110323132321043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 110323132321043 its reverse (340123231323011), we get a palindrome (450446363644054).
The spelling of 110323132321043 in words is "one hundred ten trillion, three hundred twenty-three billion, one hundred thirty-two million, three hundred twenty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •