Search a number
-
+
12010100221969 is a prime number
BaseRepresentation
bin1010111011000101000111…
…0000011110100000010001
31120112011011112102112121121
42232301101300132200101
53033233141124100334
641313210332522241
72346462323332543
oct256612160364021
946464145375547
1012010100221969
113910500522093
12141b77a320381
1369171709a8a5
142d741318d693
1515c6249c8db4
hexaec51c1e811

12010100221969 has 2 divisors, whose sum is σ = 12010100221970. Its totient is φ = 12010100221968.

The previous prime is 12010100221961. The next prime is 12010100222023. The reversal of 12010100221969 is 96912200101021.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8488697850369 + 3521402371600 = 2913537^2 + 1876540^2 .

It is a cyclic number.

It is not a de Polignac number, because 12010100221969 - 23 = 12010100221961 is a prime.

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

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

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

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

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

Almost surely, 212010100221969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 34.

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