Search a number
-
+
153405204335681 is a prime number
BaseRepresentation
bin100010111000010101101110…
…101101100000110001000001
3202010011101122110012002021212
4202320111232231200301001
5130101342324302220211
61302133213350455505
744212105654062014
oct4270255655406101
9663141573162255
10153405204335681
1144974866644801
1215256b58664595
13677a082caa5cc
1429c4bcc76737b
1512b064c3d738b
hex8b856eb60c41

153405204335681 has 2 divisors, whose sum is σ = 153405204335682. Its totient is φ = 153405204335680.

The previous prime is 153405204335623. The next prime is 153405204335687. The reversal of 153405204335681 is 186533402504351.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 152511014716225 + 894189619456 = 12349535^2 + 945616^2 .

It is a cyclic number.

It is not a de Polignac number, because 153405204335681 - 234 = 153388024466497 is a prime.

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

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

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

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

Almost surely, 2153405204335681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5184000, while the sum is 50.

The spelling of 153405204335681 in words is "one hundred fifty-three trillion, four hundred five billion, two hundred four million, three hundred thirty-five thousand, six hundred eighty-one".