Search a number
-
+
116815328236951 is a prime number
BaseRepresentation
bin11010100011111000110000…
…001001001101010110010111
3120022121102210002000012010121
4122203320300021031112113
5110302400243012040301
61052240115420332411
733414425505635401
oct3243706011152627
9508542702005117
10116815328236951
1134248114469663
12111277150a4107
13502483b1300c6
1420bbc6bb1db71
15d7897c4dc3a1
hex6a3e3024d597

116815328236951 has 2 divisors, whose sum is σ = 116815328236952. Its totient is φ = 116815328236950.

The previous prime is 116815328236907. The next prime is 116815328237051. The reversal of 116815328236951 is 159632823518611.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 116815328236951 - 223 = 116815319848343 is a prime.

It is a super-2 number, since 2×1168153282369512 (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 116815328236951.

It is a congruent number.

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

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

Almost surely, 2116815328236951 is an apocalyptic number.

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

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

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

The product of its digits is 18662400, while the sum is 61.

The spelling of 116815328236951 in words is "one hundred sixteen trillion, eight hundred fifteen billion, three hundred twenty-eight million, two hundred thirty-six thousand, nine hundred fifty-one".