Search a number
-
+
110426020760641 is a prime number
BaseRepresentation
bin11001000110111010001111…
…101111011100110001000001
3112110222121212020202202021111
4121012322033233130301001
5103433204442303320031
61030505002535123321
732155005510320515
oct3106721757346101
9473877766682244
10110426020760641
1132204459a12153
1210475376b13541
13498018a771891
141d3a90dc80145
15cb767a7111b1
hex646e8fbdcc41

110426020760641 has 2 divisors, whose sum is σ = 110426020760642. Its totient is φ = 110426020760640.

The previous prime is 110426020760579. The next prime is 110426020760701. The reversal of 110426020760641 is 146067020624011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 108924268549041 + 1501752211600 = 10436679^2 + 1225460^2 .

It is a cyclic number.

It is not a de Polignac number, because 110426020760641 - 211 = 110426020758593 is a prime.

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

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

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

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

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

Almost surely, 2110426020760641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 96768, while the sum is 40.

The spelling of 110426020760641 in words is "one hundred ten trillion, four hundred twenty-six billion, twenty million, seven hundred sixty thousand, six hundred forty-one".