Search a number
-
+
109910499483139 is a prime number
BaseRepresentation
bin11000111111011010001000…
…010001110101111000000011
3112102011100012200112110001021
4120333122020101311320003
5103401233200331430024
61025432104133050311
732102525431625215
oct3077321021657003
9472140180473037
10109910499483139
1132025865663193
12103b1483a86997
134943691ab2c44
141d1d9a75025b5
15ca905714ade4
hex63f688475e03

109910499483139 has 2 divisors, whose sum is σ = 109910499483140. Its totient is φ = 109910499483138.

The previous prime is 109910499483133. The next prime is 109910499483209. The reversal of 109910499483139 is 931384994019901.

It is an a-pointer prime, because the next prime (109910499483209) can be obtained adding 109910499483139 to its sum of digits (70).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 109910499483139 - 27 = 109910499483011 is a prime.

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

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

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

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

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

Almost surely, 2109910499483139 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 68024448, while the sum is 70.

The spelling of 109910499483139 in words is "one hundred nine trillion, nine hundred ten billion, four hundred ninety-nine million, four hundred eighty-three thousand, one hundred thirty-nine".