Search a number
-
+
275219032 = 23113127489
BaseRepresentation
bin10000011001111…
…000001001011000
3201011212120112111
4100121320021120
51030424002112
643150522104
76551215564
oct2031701130
9634776474
10275219032
11131399150
1278206334
13450324ca
14287a26a4
15192665a7
hex10678258

275219032 has 16 divisors (see below), whose sum is σ = 562948200. Its totient is φ = 125099520.

The previous prime is 275219029. The next prime is 275219039. The reversal of 275219032 is 230912572.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (275219039) 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 3 ways as a sum of consecutive naturals, for example, 1563657 + ... + 1563832.

Almost surely, 2275219032 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 7560, while the sum is 31.

The square root of 275219032 is about 16589.7267005819. The cubic root of 275219032 is about 650.4683267880.

The spelling of 275219032 in words is "two hundred seventy-five million, two hundred nineteen thousand, thirty-two".

Divisors: 1 2 4 8 11 22 44 88 3127489 6254978 12509956 25019912 34402379 68804758 137609516 275219032