Search a number
-
+
308885472 = 253273741101
BaseRepresentation
bin10010011010010…
…011011111100000
3210112020000012200
4102122103133200
51113033313342
650352253200
710440324510
oct2232233740
9715200180
10308885472
111493a3255
1287541200
134bcbc28c
142d047840
151c1b694c
hex126937e0

308885472 has 288 divisors, whose sum is σ = 1066613184. Its totient is φ = 82944000.

The previous prime is 308885471. The next prime is 308885501. The reversal of 308885472 is 274588803.

It is a tau number, because it is divible by the number of its divisors (288).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (308885471) 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, 3058222 + ... + 3058322.

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

Almost surely, 2308885472 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 308885472 is about 17575.1378941959. The cubic root of 308885472 is about 675.9778945423.

The spelling of 308885472 in words is "three hundred eight million, eight hundred eighty-five thousand, four hundred seventy-two".