Search a number
-
+
155276051 = 726747297
BaseRepresentation
bin10010100000101…
…01001100010011
3101211011211200212
421100111030103
5304222313201
623224034335
73563552600
oct1120251423
9354154625
10155276051
117a716217
12440029ab
1326228528
141689d6a7
15d972abb
hex9415313

155276051 has 12 divisors (see below), whose sum is σ = 183327048. Its totient is φ = 131104512.

The previous prime is 155276047. The next prime is 155276057. The reversal of 155276051 is 150672551.

It is not a de Polignac number, because 155276051 - 22 = 155276047 is a prime.

It is a super-2 number, since 2×1552760512 = 48221304028309202, which contains 22 as substring.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (155276057) by changing a digit.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 20366 + ... + 26931.

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

Almost surely, 2155276051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 47378 (or 47371 counting only the distinct ones).

The product of its (nonzero) digits is 10500, while the sum is 32.

The square root of 155276051 is about 12460.9811411461. The cubic root of 155276051 is about 537.4872408004.

The spelling of 155276051 in words is "one hundred fifty-five million, two hundred seventy-six thousand, fifty-one".

Divisors: 1 7 49 67 469 3283 47297 331079 2317553 3168899 22182293 155276051