Search a number
-
+
110150225012147 is a prime number
BaseRepresentation
bin11001000010111001011001…
…000010001010010110110011
3112110000020222120102002121212
4121002321121002022112303
5103414200130100342042
61030134151555110335
732126043155201105
oct3102713102122663
9473006876362555
10110150225012147
11321084a24552a1
121042ba275a23ab
1349601773547a8
141d2b429545575
15cb03d7e3c482
hex642e5908a5b3

110150225012147 has 2 divisors, whose sum is σ = 110150225012148. Its totient is φ = 110150225012146.

The previous prime is 110150225012083. The next prime is 110150225012203. The reversal of 110150225012147 is 741210522051011.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 110150225012147 - 26 = 110150225012083 is a prime.

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

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

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

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

Almost surely, 2110150225012147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 5600, while the sum is 32.

Adding to 110150225012147 its reverse (741210522051011), we get a palindrome (851360747063158).

The spelling of 110150225012147 in words is "one hundred ten trillion, one hundred fifty billion, two hundred twenty-five million, twelve thousand, one hundred forty-seven".