Search a number
-
+
110001010109951 is a prime number
BaseRepresentation
bin11001000000101110011011…
…001000011110110111111111
3112102110222211112020200110202
4121000232123020132313333
5103404224032042004301
61025541433313554115
732112211401355532
oct3100563310366777
9472428745220422
10110001010109951
1132060191539804
1210406b2387593b
13494c08763b25c
141d24112160a19
15cab5a323e66b
hex640b9b21edff

110001010109951 has 2 divisors, whose sum is σ = 110001010109952. Its totient is φ = 110001010109950.

The previous prime is 110001010109927. The next prime is 110001010109957. The reversal of 110001010109951 is 159901010100011.

It is a happy number.

It is a strong prime.

It is an emirp because it is prime and its reverse (159901010100011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 110001010109951 - 226 = 110000943001087 is a prime.

It is a super-2 number, since 2×1100010101099512 (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 (110001010109957) by changing a digit.

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

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

Almost surely, 2110001010109951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 405, while the sum is 29.

Adding to 110001010109951 its reverse (159901010100011), we get a palindrome (269902020209962).

The spelling of 110001010109951 in words is "one hundred ten trillion, one billion, ten million, one hundred nine thousand, nine hundred fifty-one".