Search a number
-
+
110214132433487 is a prime number
BaseRepresentation
bin11001000011110100111010…
…001101101000001001001111
3112110020100221101111110202222
4121003310322031220021033
5103421222020400332422
61030223401245005555
732133464642256545
oct3103647215501117
9473210841443688
10110214132433487
1132132607533895
12104402a1b538bb
1349661c048a7c4
141d3056cd2dd95
15cb1dc8729842
hex643d3a36824f

110214132433487 has 2 divisors, whose sum is σ = 110214132433488. Its totient is φ = 110214132433486.

The previous prime is 110214132433441. The next prime is 110214132433523. The reversal of 110214132433487 is 784334231412011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110214132433487 - 26 = 110214132433423 is a prime.

It is a super-2 number, since 2×1102141324334872 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (110214132433387) 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, 55107066216743 + 55107066216744.

It is an arithmetic number, because the mean of its divisors is an integer number (55107066216744).

Almost surely, 2110214132433487 is an apocalyptic number.

110214132433487 is a deficient number, since it is larger than the sum of its proper divisors (1).

110214132433487 is an equidigital number, since it uses as much as digits as its factorization.

110214132433487 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 387072, while the sum is 44.

Adding to 110214132433487 its reverse (784334231412011), we get a palindrome (894548363845498).

The spelling of 110214132433487 in words is "one hundred ten trillion, two hundred fourteen billion, one hundred thirty-two million, four hundred thirty-three thousand, four hundred eighty-seven".