Search a number
-
+
10200021111 = 327659245683
BaseRepresentation
bin10010111111111011…
…11111100001110111
3222022212010202111200
421133331333201313
5131342201133421
64404045503543
7510523514610
oct113775774167
928285122450
1010200021111
114364711915
121b87b71bb3
13c67281267
146ca94cc07
153ea71d726
hex25ff7f877

10200021111 has 24 divisors (see below), whose sum is σ = 16863749760. Its totient is φ = 5819715216.

The previous prime is 10200021103. The next prime is 10200021179. The reversal of 10200021111 is 11112000201.

It is a happy number.

It is not a de Polignac number, because 10200021111 - 23 = 10200021103 is a prime.

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

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

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 81325 + ... + 164358.

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

Almost surely, 210200021111 is an apocalyptic number.

10200021111 is a deficient number, since it is larger than the sum of its proper divisors (6663728649).

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

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

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

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 10200021111 its reverse (11112000201), we get a palindrome (21312021312).

The spelling of 10200021111 in words is "ten billion, two hundred million, twenty-one thousand, one hundred eleven".

Divisors: 1 3 7 9 21 63 659 1977 4613 5931 13839 41517 245683 737049 1719781 2211147 5159343 15478029 161905097 485715291 1133335679 1457145873 3400007037 10200021111