Search a number
-
+
10231102011 = 3131631609423
BaseRepresentation
bin10011000011101001…
…00011101000111011
3222102000121211111010
421201310203220323
5131423130231021
64411120005003
7511351634514
oct114164435073
928360554433
1010231102011
114380210409
121b96460763
13c70844220
146d0b1da0b
153ed30c976
hex261d23a3b

10231102011 has 16 divisors (see below), whose sum is σ = 14780950016. Its totient is φ = 6257432736.

The previous prime is 10231102003. The next prime is 10231102043. The reversal of 10231102011 is 11020113201.

10231102011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 10231102011 - 23 = 10231102003 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 798355 + ... + 811068.

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

Almost surely, 210231102011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1609602.

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

Adding to 10231102011 its reverse (11020113201), we get a palindrome (21251215212).

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

Divisors: 1 3 13 39 163 489 2119 6357 1609423 4828269 20922499 62767497 262335949 787007847 3410367337 10231102011