Search a number
-
+
110011010115001 is a prime number
BaseRepresentation
bin11001000000110111101111…
…001011011110010110111001
3112102111221122110000120112011
4121000313233023132112321
5103404410022042140001
61025550205500445521
732113014246121312
oct3100675713362671
9472457573016464
10110011010115001
1132064453257596
1210408a548498a1
13494ccbc32aac8
141d247c02c5609
15cab98b0edd51
hex640def2de5b9

110011010115001 has 2 divisors, whose sum is σ = 110011010115002. Its totient is φ = 110011010115000.

The previous prime is 110011010114959. The next prime is 110011010115037. The reversal of 110011010115001 is 100511010110011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 64795673779776 + 45215336335225 = 8049576^2 + 6724235^2 .

It is a cyclic number.

It is not a de Polignac number, because 110011010115001 - 211 = 110011010112953 is a prime.

It is not a weakly prime, because it can be changed into another prime (110011010515001) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005505057500 + 55005505057501.

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

Almost surely, 2110011010115001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5, while the sum is 13.

Adding to 110011010115001 its reverse (100511010110011), we get a palindrome (210522020225012).

The spelling of 110011010115001 in words is "one hundred ten trillion, eleven billion, ten million, one hundred fifteen thousand, one".