Search a number
-
+
10021011111 = 321131798387
BaseRepresentation
bin10010101010100110…
…00111111010100111
3221212101022002221200
421111103013322213
5131010334323421
64334213013543
7503221121556
oct112523077247
927771262850
1010021011111
114282665a71
121b380242b3
13c39165b97
146b0c71d9d
153d9b5d726
hex2554c7ea7

10021011111 has 12 divisors (see below), whose sum is σ = 14476219992. Its totient is φ = 6680015856.

The previous prime is 10021011109. The next prime is 10021011127. The reversal of 10021011111 is 11111012001.

It is not a de Polignac number, because 10021011111 - 21 = 10021011109 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 = 10021011093 and 10021011102.

It is a congruent number.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52660 + ... + 151046.

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

Almost surely, 210021011111 is an apocalyptic number.

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

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

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

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

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

Adding to 10021011111 its reverse (11111012001), we get a palindrome (21132023112).

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

Divisors: 1 3 9 11317 33951 98387 101853 295161 885483 1113445679 3340337037 10021011111