Search a number
-
+
105612964498897 is a prime number
BaseRepresentation
bin11000000000110111101111…
…001110111000110111010001
3111211221111112002021111021221
4120000313233032320313101
5102320330322402431042
61012341532011445041
731150166500160332
oct3000675716706721
9454844462244257
10105612964498897
1130719230154129
12ba18600156781
1346c134ba8951b
141c119a25a6289
15c323800ebd67
hex600def3b8dd1

105612964498897 has 2 divisors, whose sum is σ = 105612964498898. Its totient is φ = 105612964498896.

The previous prime is 105612964498889. The next prime is 105612964498913. The reversal of 105612964498897 is 798894469216501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 82269997418961 + 23342967079936 = 9070281^2 + 4831456^2 .

It is a cyclic number.

It is not a de Polignac number, because 105612964498897 - 23 = 105612964498889 is a prime.

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

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

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

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

Almost surely, 2105612964498897 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1881169920, while the sum is 79.

The spelling of 105612964498897 in words is "one hundred five trillion, six hundred twelve billion, nine hundred sixty-four million, four hundred ninety-eight thousand, eight hundred ninety-seven".