Search a number
-
+
102110101969 is a prime number
BaseRepresentation
bin101111100011000111…
…1001000000111010001
3100202120020011121222111
41133012033020013101
53133110141230334
6114524141505321
710243245355201
oct1370617100721
9322506147874
10102110101969
113a339543a27
1217958572241
139823a266a5
144d293ba401
1529c95ea064
hex17c63c81d1

102110101969 has 2 divisors, whose sum is σ = 102110101970. Its totient is φ = 102110101968.

The previous prime is 102110101957. The next prime is 102110101981. The reversal of 102110101969 is 969101011201.

It is a balanced prime because it is at equal distance from previous prime (102110101957) and next prime (102110101981).

It can be written as a sum of positive squares in only one way, i.e., 51171868944 + 50938233025 = 226212^2 + 225695^2 .

It is a cyclic number.

It is not a de Polignac number, because 102110101969 - 223 = 102101713361 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 102110101969.

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

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

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

Almost surely, 2102110101969 is an apocalyptic number.

It is an amenable number.

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

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

102110101969 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 972, while the sum is 31.

The spelling of 102110101969 in words is "one hundred two billion, one hundred ten million, one hundred one thousand, nine hundred sixty-nine".