Search a number
-
+
110110101099961 is a prime number
BaseRepresentation
bin11001000010010100000001…
…011101100101010110111001
3112102212102102021012011120011
4121002110001131211112321
5103413020441340144321
61030103514312301521
732123122644443224
oct3102240135452671
9472772367164504
10110110101099961
11320a2482563196
12104240aa0a18a1
134959451708711
141d295007205bb
15cae33a62aae1
hex6425017655b9

110110101099961 has 2 divisors, whose sum is σ = 110110101099962. Its totient is φ = 110110101099960.

The previous prime is 110110101099953. The next prime is 110110101100063. The reversal of 110110101099961 is 169990101011011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 110079042324736 + 31058775225 = 10491856^2 + 176235^2 .

It is a cyclic number.

It is not a de Polignac number, because 110110101099961 - 23 = 110110101099953 is a prime.

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

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

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

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

Almost surely, 2110110101099961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4374, while the sum is 40.

The spelling of 110110101099961 in words is "one hundred ten trillion, one hundred ten billion, one hundred one million, ninety-nine thousand, nine hundred sixty-one".