Search a number
-
+
20260422 = 23372131931
BaseRepresentation
bin100110101001…
…0011001000110
31102010100002000
41031102121012
520141313142
62002130130
7334132200
oct115223106
942110060
1020260422
1110488a56
126950946
134274b20
142995770
151ba314c
hex1352646

20260422 has 192 divisors, whose sum is σ = 61286400. Its totient is φ = 4898880.

The previous prime is 20260399. The next prime is 20260433. The reversal of 20260422 is 22406202.

It is a happy number.

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

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

It is a congruent number.

It is an unprimeable number.

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 95 ways as a sum of consecutive naturals, for example, 653547 + ... + 653577.

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

Almost surely, 220260422 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 20260422, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30643200).

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

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

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

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

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

The product of its (nonzero) digits is 384, while the sum is 18.

The square root of 20260422 is about 4501.1578510423. The cubic root of 20260422 is about 272.6148414750.

Adding to 20260422 its reverse (22406202), we get a palindrome (42666624).

The spelling of 20260422 in words is "twenty million, two hundred sixty thousand, four hundred twenty-two".