Search a number
-
+
21397068 = 22337113183
BaseRepresentation
bin101000110011…
…1111001001100
31111021002021000
41101213321030
520434201233
62042340300
7346605060
oct121477114
944232230
1021397068
1111094a30
1271ba690
1345822b4
142badaa0
151d29d13
hex1467e4c

21397068 has 192 divisors, whose sum is σ = 72253440. Its totient is φ = 5313600.

The previous prime is 21397043. The next prime is 21397069. The reversal of 21397068 is 86079312.

It is a Harshad number since it is a multiple of its sum of digits (36).

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

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 257755 + ... + 257837.

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

Almost surely, 221397068 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 18144, while the sum is 36.

The square root of 21397068 is about 4625.6964880978. The cubic root of 21397068 is about 277.6204298319.

The spelling of 21397068 in words is "twenty-one million, three hundred ninety-seven thousand, sixty-eight".