Search a number
-
+
136046516035333 is a prime number
BaseRepresentation
bin11110111011101111001100…
…010000101101111100000101
3122211200220211121200021020111
4132323233030100231330011
5120312441231101112313
61201202523501033021
740441015331043211
oct3673571420557405
9584626747607214
10136046516035333
113a392004638492
1213312886b55771
135abb192941037
142584987ad5941
1510add370d543d
hex7bbbcc42df05

136046516035333 has 2 divisors, whose sum is σ = 136046516035334. Its totient is φ = 136046516035332.

The previous prime is 136046516035277. The next prime is 136046516035369. The reversal of 136046516035333 is 333530615640631.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 124988084557249 + 11058431478084 = 11179807^2 + 3325422^2 .

It is an emirp because it is prime and its reverse (333530615640631) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 136046516035333 - 217 = 136046515904261 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2136046516035333 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5248800, while the sum is 49.

The spelling of 136046516035333 in words is "one hundred thirty-six trillion, forty-six billion, five hundred sixteen million, thirty-five thousand, three hundred thirty-three".