Search a number
-
+
10915050263017 is a prime number
BaseRepresentation
bin1001111011010101101110…
…1100011001000111101001
31102122110122121201220122111
42132311123230121013221
52412313010331404032
635114145503522321
72204405056265545
oct236653354310751
942573577656574
1010915050263017
11352905735620a
1212834b02b93a1
136123919ab6b4
1429a4112a0a25
1513ddd38b1c47
hex9ed5bb191e9

10915050263017 has 2 divisors, whose sum is σ = 10915050263018. Its totient is φ = 10915050263016.

The previous prime is 10915050263003. The next prime is 10915050263023. The reversal of 10915050263017 is 71036205051901.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7927766665641 + 2987283597376 = 2815629^2 + 1728376^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10915050263017 is a prime.

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

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

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

Almost surely, 210915050263017 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10915050263017 in words is "ten trillion, nine hundred fifteen billion, fifty million, two hundred sixty-three thousand, seventeen".