Search a number
-
+
155109466951 is a prime number
BaseRepresentation
bin1001000001110100111…
…1101010001101000111
3112211100211211022212021
42100131033222031013
510020131010420301
6155131210104011
714130520500235
oct2203517521507
9484324738767
10155109466951
115a86628330a
1226089a1b007
131181bcb789a
1477161c9955
15407c45a8a1
hex241d3ea347

155109466951 has 2 divisors, whose sum is σ = 155109466952. Its totient is φ = 155109466950.

The previous prime is 155109466949. The next prime is 155109466969. The reversal of 155109466951 is 159664901551.

155109466951 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 155109466951 - 21 = 155109466949 is a prime.

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

Together with 155109466949, it forms a pair of twin primes.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2155109466951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1458000, while the sum is 52.

The spelling of 155109466951 in words is "one hundred fifty-five billion, one hundred nine million, four hundred sixty-six thousand, nine hundred fifty-one".