Search a number
-
+
248490792 = 2332112931349
BaseRepresentation
bin11101100111110…
…10101100101000
3122022120122021200
432303322230220
51002103201132
640354004200
76105064644
oct1663725450
9568518250
10248490792
111182a28a0
126b276660
133c634794
1425005c24
1516c36d7c
hexecfab28

248490792 has 192 divisors, whose sum is σ = 786240000. Its totient is φ = 70156800.

The previous prime is 248490773. The next prime is 248490793. The reversal of 248490792 is 297094842.

It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.

It is not an unprimeable number, because it can be changed into a prime (248490793) by changing a digit.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 711834 + ... + 712182.

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

Almost surely, 2248490792 is an apocalyptic number.

248490792 is a gapful number since it is divisible by the number (22) 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 248490792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (393120000).

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

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

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

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

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

The product of its (nonzero) digits is 290304, while the sum is 45.

The square root of 248490792 is about 15763.5907077036. The cubic root of 248490792 is about 628.6903101985.

The spelling of 248490792 in words is "two hundred forty-eight million, four hundred ninety thousand, seven hundred ninety-two".