Search a number
-
+
155671040 = 295721773
BaseRepresentation
bin10010100011101…
…01101000000000
3101211220220112002
421101311220000
5304322433130
623240323132
73600116300
oct1121655000
9354826462
10155671040
117a965a58
12441734a8
1326336255
1416963600
15d9eeb45
hex9475a00

155671040 has 240 divisors, whose sum is σ = 466021512. Its totient is φ = 49545216.

The previous prime is 155671027. The next prime is 155671067. The reversal of 155671040 is 40176551.

It can be written as a sum of positive squares in 4 ways, for example, as 143616256 + 12054784 = 11984^2 + 3472^2 .

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

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2132444 + ... + 2132516.

Almost surely, 2155671040 is an apocalyptic number.

155671040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 155671040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (233010756).

155671040 is an abundant number, since it is smaller than the sum of its proper divisors (310350472).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 4200, while the sum is 29.

The square root of 155671040 is about 12476.8201077037. The cubic root of 155671040 is about 537.9426056894.

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