Search a number
-
+
253050111 = 3264743457
BaseRepresentation
bin11110001010100…
…11110011111111
3122122011021111100
433011103303333
51004240100421
641035424143
76161614266
oct1705236377
9578137440
10253050111
1111a927326
12708b5053
134056cac2
14258715dd
1517337c26
hexf153cff

253050111 has 12 divisors (see below), whose sum is σ = 366090192. Its totient is φ = 168435456.

The previous prime is 253050103. The next prime is 253050157. The reversal of 253050111 is 111050352.

It is not a de Polignac number, because 253050111 - 23 = 253050103 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (253050101) 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 in 11 ways as a sum of consecutive naturals, for example, 15906 + ... + 27551.

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

Almost surely, 2253050111 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 150, while the sum is 18.

The square root of 253050111 is about 15907.5488683832. The cubic root of 253050111 is about 632.5121087945.

The spelling of 253050111 in words is "two hundred fifty-three million, fifty thousand, one hundred eleven".

Divisors: 1 3 9 647 1941 5823 43457 130371 391113 28116679 84350037 253050111