Search a number
-
+
10153111217 is a prime number
BaseRepresentation
bin10010111010010110…
…00010111010110001
3222012120212111020012
421131023002322301
5131243144024332
64355252224305
7506414010224
oct113513027261
928176774205
1010153111217
114340191807
121b7430b095
13c5a638522
146c461b5bb
153e65543b2
hex25d2c2eb1

10153111217 has 2 divisors, whose sum is σ = 10153111218. Its totient is φ = 10153111216.

The previous prime is 10153111183. The next prime is 10153111231. The reversal of 10153111217 is 71211135101.

10153111217 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7366960561 + 2786150656 = 85831^2 + 52784^2 .

It is a cyclic number.

It is not a de Polignac number, because 10153111217 - 210 = 10153110193 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 210153111217 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 210, while the sum is 23.

Adding to 10153111217 its reverse (71211135101), we get a palindrome (81364246318).

The spelling of 10153111217 in words is "ten billion, one hundred fifty-three million, one hundred eleven thousand, two hundred seventeen".