Search a number
-
+
106053615444131 is a prime number
BaseRepresentation
bin11000000111010010001000…
…000100110110000010100011
3111220111121220210202211202222
4120013102020010312002203
5102400040301023203011
61013320205222501255
731224056312333555
oct3007221004660243
9456447823684688
10106053615444131
11308790a4119333
12ba89a9929482b
134723a752a23c4
141c290455814d5
15c3da7070eddb
hex6074881360a3

106053615444131 has 2 divisors, whose sum is σ = 106053615444132. Its totient is φ = 106053615444130.

The previous prime is 106053615444113. The next prime is 106053615444211. The reversal of 106053615444131 is 131444516350601.

It is a happy number.

Together with previous prime (106053615444113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 106053615444131 - 230 = 106052541702307 is a prime.

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

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

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

Almost surely, 2106053615444131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 518400, while the sum is 44.

The spelling of 106053615444131 in words is "one hundred six trillion, fifty-three billion, six hundred fifteen million, four hundred forty-four thousand, one hundred thirty-one".