Search a number
-
+
25767952 = 2471912109
BaseRepresentation
bin110001001001…
…1000000010000
31210111010222121
41202103000100
523044033302
62320144024
7432011140
oct142230020
953433877
1025767952
11135aa931
128768014
135452912
1435ca920
1523dee37
hex1893010

25767952 has 40 divisors (see below), whose sum is σ = 60065600. Its totient is φ = 10461312.

The previous prime is 25767949. The next prime is 25767991. The reversal of 25767952 is 25976752.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3927 + ... + 8182.

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

Almost surely, 225767952 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The product of its digits is 264600, while the sum is 43.

The square root of 25767952 is about 5076.2143374763. The cubic root of 25767952 is about 295.3656368293.

The spelling of 25767952 in words is "twenty-five million, seven hundred sixty-seven thousand, nine hundred fifty-two".

Divisors: 1 2 4 7 8 14 16 19 28 38 56 76 112 133 152 266 304 532 1064 2128 12109 24218 48436 84763 96872 169526 193744 230071 339052 460142 678104 920284 1356208 1610497 1840568 3220994 3681136 6441988 12883976 25767952