Search a number
-
+
47651029169 is a prime number
BaseRepresentation
bin101100011000001110…
…010000000010110001
311112222212211002102012
4230120032100002301
51240042130413134
633520210532305
73304560031202
oct543016200261
9145885732365
1047651029169
1119232844547
12929a297095
13465520ca63
1424407955a9
15138d54d6ce
hexb183900b1

47651029169 has 2 divisors, whose sum is σ = 47651029170. Its totient is φ = 47651029168.

The previous prime is 47651029133. The next prime is 47651029177. The reversal of 47651029169 is 96192015674.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 42143162944 + 5507866225 = 205288^2 + 74215^2 .

It is a cyclic number.

It is not a de Polignac number, because 47651029169 - 220 = 47649980593 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 247651029169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 816480, while the sum is 50.

The spelling of 47651029169 in words is "forty-seven billion, six hundred fifty-one million, twenty-nine thousand, one hundred sixty-nine".