Search a number
-
+
11213246305537 is a prime number
BaseRepresentation
bin1010001100101100100110…
…0100000001010100000001
31110200222100102012101221121
42203023021210001110001
52432204212023234122
635503143315552241
72235062460652033
oct243131144012401
943628312171847
1011213246305537
113633569235561
1213112515bb681
13634534b62b33
142aaa1c9b9c53
15146a379d4bc7
hexa32c9901501

11213246305537 has 2 divisors, whose sum is σ = 11213246305538. Its totient is φ = 11213246305536.

The previous prime is 11213246305531. The next prime is 11213246305567. The reversal of 11213246305537 is 73550364231211.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6211653997761 + 5001592307776 = 2492319^2 + 2236424^2 .

It is a cyclic number.

It is not a de Polignac number, because 11213246305537 - 211 = 11213246303489 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11213246305493 and 11213246305502.

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

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

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

Almost surely, 211213246305537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 453600, while the sum is 43.

The spelling of 11213246305537 in words is "eleven trillion, two hundred thirteen billion, two hundred forty-six million, three hundred five thousand, five hundred thirty-seven".