Base | Representation |
---|---|
bin | 11001000101011010010101… |
… | …000010000001011000110011 |
3 | 112110121210000200001021112002 |
4 | 121011122111002001120303 |
5 | 103430013031224101321 |
6 | 1030345411144124215 |
7 | 32144401352000501 |
oct | 3105322502013063 |
9 | 473553020037462 |
10 | 110323030300211 |
11 | 32174809541953 |
12 | 1045941376666b |
13 | 497355653aa31 |
14 | 1d3593d9bb671 |
15 | cb4b4dbb920b |
hex | 645695081633 |
110323030300211 has 2 divisors, whose sum is σ = 110323030300212. Its totient is φ = 110323030300210.
The previous prime is 110323030300163. The next prime is 110323030300243. The reversal of 110323030300211 is 112003030323011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110323030300211 is a prime.
It is not a weakly prime, because it can be changed into another prime (110323030330211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55161515150105 + 55161515150106.
It is an arithmetic number, because the mean of its divisors is an integer number (55161515150106).
Almost surely, 2110323030300211 is an apocalyptic number.
110323030300211 is a deficient number, since it is larger than the sum of its proper divisors (1).
110323030300211 is an equidigital number, since it uses as much as digits as its factorization.
110323030300211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 110323030300211 its reverse (112003030323011), we get a palindrome (222326060623222).
The spelling of 110323030300211 in words is "one hundred ten trillion, three hundred twenty-three billion, thirty million, three hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •