Search a number
-
+
110100100001071 is a prime number
BaseRepresentation
bin11001000010001010101101…
…010110011010110100101111
3112102211110121021100201001011
4121002022231112122310233
5103412340001100013241
61030055142050130051
732122320054503425
oct3102125526326457
9472743537321034
10110100100001071
1132099210168604
1210422178880927
13495851972501b
141d28c32393115
15cade52602281
hex6422ad59ad2f

110100100001071 has 2 divisors, whose sum is σ = 110100100001072. Its totient is φ = 110100100001070.

The previous prime is 110100100001039. The next prime is 110100100001161. The reversal of 110100100001071 is 170100001001011.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 110100100001071 - 25 = 110100100001039 is a prime.

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

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

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

Almost surely, 2110100100001071 is an apocalyptic number.

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

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

110100100001071 is an evil number, because the sum of its binary digits is even.

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

Adding to 110100100001071 its reverse (170100001001011), we get a palindrome (280200101002082).

The spelling of 110100100001071 in words is "one hundred ten trillion, one hundred billion, one hundred million, one thousand, seventy-one".