Search a number
-
+
110021032969649 is a prime number
BaseRepresentation
bin11001000001000001000100…
…100101101000010110110001
3112102112220111221210100022222
4121001001010211220112301
5103410041033420012044
61025554544221210425
732113520522022014
oct3101010445502661
9472486457710288
10110021032969649
113206872696163a
121040a991400a15
134950c2898ab29
141d250914b737b
15cabd75ec38ee
hex6410449685b1

110021032969649 has 2 divisors, whose sum is σ = 110021032969650. Its totient is φ = 110021032969648.

The previous prime is 110021032969633. The next prime is 110021032969663. The reversal of 110021032969649 is 946969230120011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 65067454273600 + 44953578696049 = 8066440^2 + 6704743^2 .

It is a cyclic number.

It is not a de Polignac number, because 110021032969649 - 24 = 110021032969633 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2110021032969649 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1259712, while the sum is 53.

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