Search a number
-
+
106292584710131 is a prime number
BaseRepresentation
bin11000001010110000101011…
…110000001111111111110011
3111221100110201222121100112112
4120022300223300033333303
5102412444203141211011
61014022050031315535
731250246223514151
oct3012605360177763
9457313658540475
10106292584710131
1130960483032896
12bb0826b67bbab
134740469c65851
141c36834da23d1
15c44da9e1858b
hex60ac2bc0fff3

106292584710131 has 2 divisors, whose sum is σ = 106292584710132. Its totient is φ = 106292584710130.

The previous prime is 106292584710101. The next prime is 106292584710173. The reversal of 106292584710131 is 131017485292601.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 106292584710131 - 226 = 106292517601267 is a prime.

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

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅106292584710131 = 212585169420262 is not.

Almost surely, 2106292584710131 is an apocalyptic number.

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

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

106292584710131 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 725760, while the sum is 50.

The spelling of 106292584710131 in words is "one hundred six trillion, two hundred ninety-two billion, five hundred eighty-four million, seven hundred ten thousand, one hundred thirty-one".