Search a number
-
+
153976262150047 is a prime number
BaseRepresentation
bin100011000000101001100100…
…011010001100011110011111
3202012011222122110012202220211
4203000221210122030132133
5130140221341102300142
61303251415053353251
744301263213314051
oct4300514432143637
9665158573182824
10153976262150047
1145074a69915917
121532976a798827
1367bbb8c77308c
142a046c2c7d8d1
1512c042142c917
hex8c0a6468c79f

153976262150047 has 2 divisors, whose sum is σ = 153976262150048. Its totient is φ = 153976262150046.

The previous prime is 153976262149987. The next prime is 153976262150071. The reversal of 153976262150047 is 740051262679351.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 153976262150047 - 235 = 153941902411679 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2153976262150047 is an apocalyptic number.

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

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

153976262150047 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 19051200, while the sum is 58.

The spelling of 153976262150047 in words is "one hundred fifty-three trillion, nine hundred seventy-six billion, two hundred sixty-two million, one hundred fifty thousand, forty-seven".