Search a number
-
+
235827072 = 27331329181
BaseRepresentation
bin11100000111001…
…10111110000000
3121102202020221000
432003212332000
5440332431242
635222332000
75562332325
oct1603467600
9542666830
10235827072
11111133408
1266b8a000
1339b1c660
142346ab4c
1515a84a4c
hexe0e6f80

235827072 has 256 divisors, whose sum is σ = 779688000. Its totient is φ = 69672960.

The previous prime is 235827041. The next prime is 235827083. The reversal of 235827072 is 270728532.

It is a happy number.

235827072 is a `hidden beast` number, since 2 + 3 + 582 + 7 + 0 + 72 = 666.

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

It is a Harshad number since it is a multiple of its sum of digits (36).

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1302822 + ... + 1303002.

Almost surely, 2235827072 is an apocalyptic number.

It is an amenable number.

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

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

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

235827072 is a wasteful number, since it uses less digits than its factorization.

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

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

The product of its (nonzero) digits is 47040, while the sum is 36.

The square root of 235827072 is about 15356.6621373266. The cubic root of 235827072 is about 617.8236842668.

The spelling of 235827072 in words is "two hundred thirty-five million, eight hundred twenty-seven thousand, seventy-two".