Search a number
-
+
10131220011 = 311227909697
BaseRepresentation
bin10010110111101111…
…00010011000101011
3222011001200022010210
421123313202120223
5131222043020021
64353151112203
7506026643403
oct113367423053
928131608123
1010131220011
11432989a600
121b68b12663
13c55c42353
146c175d803
153e467ce76
hex25bde262b

10131220011 has 12 divisors (see below), whose sum is σ = 14847959336. Its totient is φ = 6140133120.

The previous prime is 10131219997. The next prime is 10131220097. The reversal of 10131220011 is 11002213101.

It is not a de Polignac number, because 10131220011 - 25 = 10131219979 is a prime.

It is a super-2 number, since 2×101312200112 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10131220511) 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, 13954486 + ... + 13955211.

Almost surely, 210131220011 is an apocalyptic number.

10131220011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

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

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

Adding to 10131220011 its reverse (11002213101), we get a palindrome (21133433112).

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

Divisors: 1 3 11 33 121 363 27909697 83729091 307006667 921020001 3377073337 10131220011