Search a number
-
+
116815328237051 is a prime number
BaseRepresentation
bin11010100011111000110000…
…001001001101010111111011
3120022121102210002000012021022
4122203320300021031113323
5110302400243012041201
61052240115420333055
733414425505635603
oct3243706011152773
9508542702005238
10116815328237051
1134248114469744
12111277150a418b
13502483b130172
1420bbc6bb1dc03
15d7897c4dc41b
hex6a3e3024d5fb

116815328237051 has 2 divisors, whose sum is σ = 116815328237052. Its totient is φ = 116815328237050.

The previous prime is 116815328236951. The next prime is 116815328237099. The reversal of 116815328237051 is 150732823518611.

It is a happy number.

It is a strong prime.

It is a cyclic number.

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

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

It is a junction number, because it is equal to n+sod(n) for n = 116815328236984 and 116815328237002.

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

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

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

Almost surely, 2116815328237051 is an apocalyptic number.

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

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

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

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

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