Search a number
-
+
10153011433 is a prime number
BaseRepresentation
bin10010111010010101…
…01010100011101001
3222012120200102100111
421131022222203221
5131243132331213
64355250134321
7506413113265
oct113512524351
928176612314
1010153011433
114340123844
121b742813a1
13c5a601c96
146c45d30a5
153e6534a3d
hex25d2aa8e9

10153011433 has 2 divisors, whose sum is σ = 10153011434. Its totient is φ = 10153011432.

The previous prime is 10153011391. The next prime is 10153011443. The reversal of 10153011433 is 33411035101.

10153011433 is digitally balanced in base 2 and base 3, because in such bases 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., 5805982809 + 4347028624 = 76197^2 + 65932^2 .

It is a cyclic number.

It is not a de Polignac number, because 10153011433 - 29 = 10153010921 is a prime.

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

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

Almost surely, 210153011433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 540, while the sum is 22.

Adding to 10153011433 its reverse (33411035101), we get a palindrome (43564046534).

The spelling of 10153011433 in words is "ten billion, one hundred fifty-three million, eleven thousand, four hundred thirty-three".