Search a number
-
+
47211011863013 is a prime number
BaseRepresentation
bin10101011110000001010111…
…00101110111000111100101
320012011022212120221021102102
422233000223211313013211
522142001123014104023
6244224234530221445
712641611612412645
oct1257005345670745
9205138776837372
1047211011863013
1114052094454249
125365988424885
132045c9673141b
14b9304d0b0525
1556d1004c4628
hex2af02b9771e5

47211011863013 has 2 divisors, whose sum is σ = 47211011863014. Its totient is φ = 47211011863012.

The previous prime is 47211011863003. The next prime is 47211011863097. The reversal of 47211011863013 is 31036811011274.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 45044796017764 + 2166215845249 = 6711542^2 + 1471807^2 .

It is a cyclic number.

It is not a de Polignac number, because 47211011863013 - 28 = 47211011862757 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 247211011863013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24192, while the sum is 38.

Adding to 47211011863013 its reverse (31036811011274), we get a palindrome (78247822874287).

The spelling of 47211011863013 in words is "forty-seven trillion, two hundred eleven billion, eleven million, eight hundred sixty-three thousand, thirteen".