Search a number
-
+
101227069153961 is a prime number
BaseRepresentation
bin10111000001000011000011…
…011111111010001010101001
3111021102012202111102010200222
4113001003003133322022221
5101232001014200411321
6555143023521135425
730215262065642432
oct2701030337721251
9437365674363628
10101227069153961
112a28818260a293
12b42a59878a575
134463896844bca
141add5b8420489
15ba8235b503ab
hex5c10c37fa2a9

101227069153961 has 2 divisors, whose sum is σ = 101227069153962. Its totient is φ = 101227069153960.

The previous prime is 101227069153927. The next prime is 101227069154047. The reversal of 101227069153961 is 169351960722101.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100000380000361 + 1226689153600 = 10000019^2 + 1107560^2 .

It is a cyclic number.

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

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

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

Almost surely, 2101227069153961 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 101227069153961 in words is "one hundred one trillion, two hundred twenty-seven billion, sixty-nine million, one hundred fifty-three thousand, nine hundred sixty-one".