Search a number
-
+
112305904741 is a prime number
BaseRepresentation
bin110100010010111110…
…1000001110001100101
3101201212210101002000101
41220211331001301211
53320000302422431
6123332001144101
711054021303542
oct1504575016145
9351783332011
10112305904741
11436a0834508
121992302b031
13a78a15b894
14561554bbc9
152dc4783961
hex1a25f41c65

112305904741 has 2 divisors, whose sum is σ = 112305904742. Its totient is φ = 112305904740.

The previous prime is 112305904727. The next prime is 112305904757. The reversal of 112305904741 is 147409503211.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 74026982241 + 38278922500 = 272079^2 + 195650^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 112305904741 - 227 = 112171687013 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 112305904741.

It is a congruent number.

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

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

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

Almost surely, 2112305904741 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30240, while the sum is 37.

The spelling of 112305904741 in words is "one hundred twelve billion, three hundred five million, nine hundred four thousand, seven hundred forty-one".