Search a number
-
+
10151610135661 is a prime number
BaseRepresentation
bin1001001110111001101100…
…0111011011010001101101
31022221111002011110010121001
42103232123013123101231
52312310444143320121
633331330232240301
72065300235261521
oct223563307332155
938844064403531
1010151610135661
1132643012a69a5
12117b549840091
135883a617bc77
142714aa691d81
15129100074991
hex93b9b1db46d

10151610135661 has 2 divisors, whose sum is σ = 10151610135662. Its totient is φ = 10151610135660.

The previous prime is 10151610135631. The next prime is 10151610135677. The reversal of 10151610135661 is 16653101615101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6559899112900 + 3591711022761 = 2561230^2 + 1895181^2 .

It is a cyclic number.

It is not a de Polignac number, because 10151610135661 - 213 = 10151610127469 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10151610135661.

It is a congruent number.

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

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

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

Almost surely, 210151610135661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16200, while the sum is 37.

The spelling of 10151610135661 in words is "ten trillion, one hundred fifty-one billion, six hundred ten million, one hundred thirty-five thousand, six hundred sixty-one".