Search a number
-
+
104653033027 is a prime number
BaseRepresentation
bin110000101110111001…
…1101000111001000011
3101000010110010220121021
41201131303220321003
53203312134024102
6120024341410311
710363254050314
oct1413563507103
9330113126537
10104653033027
11404239aa744
1218348109997
139b3a80781a
1450cb00460b
152ac79a6137
hex185dce8e43

104653033027 has 2 divisors, whose sum is σ = 104653033028. Its totient is φ = 104653033026.

The previous prime is 104653033007. The next prime is 104653033031. The reversal of 104653033027 is 720330356401.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 104653033027 - 215 = 104653000259 is a prime.

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

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

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

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

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

Almost surely, 2104653033027 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 45360, while the sum is 34.

Adding to 104653033027 its reverse (720330356401), we get a palindrome (824983389428).

The spelling of 104653033027 in words is "one hundred four billion, six hundred fifty-three million, thirty-three thousand, twenty-seven".