Search a number
-
+
106445565601 is a prime number
BaseRepresentation
bin110001100100010100…
…1100110111010100001
3101011202101010000000121
41203020221212322201
53221000031044401
6120522253520241
710455551243644
oct1431051467241
9334671100017
10106445565601
1141163823a21
12187684a3081
13a064cb199b
14521b0d5a5b
152b80036ca1
hex18c8a66ea1

106445565601 has 2 divisors, whose sum is σ = 106445565602. Its totient is φ = 106445565600.

The previous prime is 106445565563. The next prime is 106445565619. The reversal of 106445565601 is 106565544601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105248336400 + 1197229201 = 324420^2 + 34601^2 .

It is a cyclic number.

It is not a de Polignac number, because 106445565601 - 227 = 106311347873 is a prime.

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

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

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

Almost surely, 2106445565601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 432000, while the sum is 43.

The spelling of 106445565601 in words is "one hundred six billion, four hundred forty-five million, five hundred sixty-five thousand, six hundred one".