Search a number
-
+
11015302305253 is a prime number
BaseRepresentation
bin1010000001001011001100…
…1011100101010111100101
31110000001102100122022211211
42200102303023211113211
52420433314342232003
635232205433031421
72214554313503221
oct240226313452745
943001370568754
1011015302305253
113567621a8a384
12129aa0a555571
1361b97a79724c
142a12019ad781
151417eecd596d
hexa04b32e55e5

11015302305253 has 2 divisors, whose sum is σ = 11015302305254. Its totient is φ = 11015302305252.

The previous prime is 11015302305229. The next prime is 11015302305257. The reversal of 11015302305253 is 35250320351011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8659500946209 + 2355801359044 = 2942703^2 + 1534862^2 .

It is a cyclic number.

It is not a de Polignac number, because 11015302305253 - 25 = 11015302305221 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 211015302305253 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13500, while the sum is 31.

Adding to 11015302305253 its reverse (35250320351011), we get a palindrome (46265622656264).

The spelling of 11015302305253 in words is "eleven trillion, fifteen billion, three hundred two million, three hundred five thousand, two hundred fifty-three".