Search a number
-
+
38476846620071 is a prime number
BaseRepresentation
bin10001011111110100101101…
…10001100101110110100111
312001020100110121010022021222
420233322112301211312213
520020401040213320241
6213500004101130555
711050601061660536
oct1057722661456647
9161210417108258
1038476846620071
1111294a36911752
1243950a20b9a5b
1318614743ab862
14970409c3631d
1546ad0ed66a4b
hex22fe96c65da7

38476846620071 has 2 divisors, whose sum is σ = 38476846620072. Its totient is φ = 38476846620070.

The previous prime is 38476846620049. The next prime is 38476846620133. The reversal of 38476846620071 is 17002664867483.

It is an a-pointer prime, because the next prime (38476846620133) can be obtained adding 38476846620071 to its sum of digits (62).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 38476846620071 - 242 = 34078800108967 is a prime.

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

Almost surely, 238476846620071 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 65028096, while the sum is 62.

The spelling of 38476846620071 in words is "thirty-eight trillion, four hundred seventy-six billion, eight hundred forty-six million, six hundred twenty thousand, seventy-one".