Search a number
-
+
110009944537 is a prime number
BaseRepresentation
bin110011001110100011…
…0101000100111011001
3101111221210010012201021
41212131012220213121
53300300021211122
6122312102522441
710643102046163
oct1463506504731
9344853105637
10110009944537
1142722822639
12193a2136421
13a4b259c44c
145478651933
152cdce0e1c7
hex199d1a89d9

110009944537 has 2 divisors, whose sum is σ = 110009944538. Its totient is φ = 110009944536.

The previous prime is 110009944531. The next prime is 110009944589. The reversal of 110009944537 is 735449900011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 91399800976 + 18610143561 = 302324^2 + 136419^2 .

It is a cyclic number.

It is not a de Polignac number, because 110009944537 - 227 = 109875726809 is a prime.

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

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

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

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

Almost surely, 2110009944537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 136080, while the sum is 43.

The spelling of 110009944537 in words is "one hundred ten billion, nine million, nine hundred forty-four thousand, five hundred thirty-seven".