Search a number
-
+
4892169830641 is a prime number
BaseRepresentation
bin100011100110000110000…
…0010111000000011110001
3122022200112201121222002221
41013030030002320003301
51120123130434040031
614223233133441041
71013306346305422
oct107141402700361
918280481558087
104892169830641
111616837370315
12670175940181
13296439294922
1412cad4829649
15873cad86a11
hex4730c0b80f1

4892169830641 has 2 divisors, whose sum is σ = 4892169830642. Its totient is φ = 4892169830640.

The previous prime is 4892169830567. The next prime is 4892169830671. The reversal of 4892169830641 is 1460389612984.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4892169830625 + 16 = 2211825^2 + 4^2 .

It is a cyclic number.

It is not a de Polignac number, because 4892169830641 - 211 = 4892169828593 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 4892169830641.

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

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

Almost surely, 24892169830641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17915904, while the sum is 61.

The spelling of 4892169830641 in words is "four trillion, eight hundred ninety-two billion, one hundred sixty-nine million, eight hundred thirty thousand, six hundred forty-one".