Search a number
-
+
1012100110997 is a prime number
BaseRepresentation
bin11101011101001011101…
…11100001101010010101
310120202101222220202022012
432232211313201222111
5113040240112022442
62052541413514005
7133056532666403
oct16564567415225
93522358822265
101012100110997
11360258144428
1214419a342905
13745960b2531
1436db3484473
151b4d8bae582
hexeba5de1a95

1012100110997 has 2 divisors, whose sum is σ = 1012100110998. Its totient is φ = 1012100110996.

The previous prime is 1012100110979. The next prime is 1012100111027. The reversal of 1012100110997 is 7990110012101.

Together with previous prime (1012100110979) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 901637606116 + 110462504881 = 949546^2 + 332359^2 .

It is a cyclic number.

It is not a de Polignac number, because 1012100110997 - 210 = 1012100109973 is a prime.

It is a congruent number.

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

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

Almost surely, 21012100110997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1134, while the sum is 32.

The spelling of 1012100110997 in words is "one trillion, twelve billion, one hundred million, one hundred ten thousand, nine hundred ninety-seven".