Search a number
-
+
38670216847 is a prime number
BaseRepresentation
bin100100000000111011…
…001010111010001111
310200210222211112221121
4210000323022322033
51113144033414342
625433112541411
72536166263663
oct440073127217
9120728745847
1038670216847
11154443692a9
1275b26b1867
13385371a222
141c2bb368a3
151014db2067
hex900ecae8f

38670216847 has 2 divisors, whose sum is σ = 38670216848. Its totient is φ = 38670216846.

The previous prime is 38670216839. The next prime is 38670216899. The reversal of 38670216847 is 74861207683.

It is an a-pointer prime, because the next prime (38670216899) can be obtained adding 38670216847 to its sum of digits (52).

It is a weak prime.

It is an emirp because it is prime and its reverse (74861207683) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 38670216847 - 23 = 38670216839 is a prime.

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

It is a congruent number.

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

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

Almost surely, 238670216847 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2709504, while the sum is 52.

The spelling of 38670216847 in words is "thirty-eight billion, six hundred seventy million, two hundred sixteen thousand, eight hundred forty-seven".