Search a number
-
+
110130310322969 is a prime number
BaseRepresentation
bin11001000010100110110110…
…000001101001101100011001
3112102221100120200102001211012
4121002212312001221230121
5103413333333420313334
61030121055514143305
732124436520136566
oct3102466601515431
9472840520361735
10110130310322969
11321000030a4592
1210427baa121b35
13495b322549641
141d2a49a70986d
15caeb1e9239ce
hex6429b6069b19

110130310322969 has 2 divisors, whose sum is σ = 110130310322970. Its totient is φ = 110130310322968.

The previous prime is 110130310322951. The next prime is 110130310323017. The reversal of 110130310322969 is 969223013031011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 110112220072969 + 18090250000 = 10493437^2 + 134500^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-110130310322969 is a prime.

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

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

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

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

Almost surely, 2110130310322969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 52488, while the sum is 41.

The spelling of 110130310322969 in words is "one hundred ten trillion, one hundred thirty billion, three hundred ten million, three hundred twenty-two thousand, nine hundred sixty-nine".