Search a number
-
+
10151145253 is a prime number
BaseRepresentation
bin10010111010000111…
…00010111100100101
3222012110011121102201
421131003202330211
5131242143122003
64355142134501
7506361211444
oct113503427445
928173147381
1010151145253
11433a069747
121b73721431
13c5a0ca732
146c4268d5b
153e62b6b1d
hex25d0e2f25

10151145253 has 2 divisors, whose sum is σ = 10151145254. Its totient is φ = 10151145252.

The previous prime is 10151145241. The next prime is 10151145283. The reversal of 10151145253 is 35254115101.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9817242724 + 333902529 = 99082^2 + 18273^2 .

It is a cyclic number.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10151145203) 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, 5075572626 + 5075572627.

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

Almost surely, 210151145253 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3000, while the sum is 28.

The spelling of 10151145253 in words is "ten billion, one hundred fifty-one million, one hundred forty-five thousand, two hundred fifty-three".