Search a number
-
+
1150906375037 is a prime number
BaseRepresentation
bin10000101111110111010…
…111011001101101111101
311002000200122101120011102
4100233313113121231331
5122324024013000122
62240415153502445
7146102350530056
oct20576727315575
94060618346142
101150906375037
11404107710021
12167078271a25
13846b7564293
143d9c033372d
151ee0ebd1492
hex10bf75d9b7d

1150906375037 has 2 divisors, whose sum is σ = 1150906375038. Its totient is φ = 1150906375036.

The previous prime is 1150906374997. The next prime is 1150906375061. The reversal of 1150906375037 is 7305736090511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1143389658436 + 7516716601 = 1069294^2 + 86699^2 .

It is a cyclic number.

It is not a de Polignac number, because 1150906375037 - 224 = 1150889597821 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21150906375037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 595350, while the sum is 47.

The spelling of 1150906375037 in words is "one trillion, one hundred fifty billion, nine hundred six million, three hundred seventy-five thousand, thirty-seven".