Base | Representation |
---|---|
bin | 10010110111101110… |
… | …01101001010110111 |
3 | 222011001111212221021 |
4 | 21123313031022313 |
5 | 131222032224421 |
6 | 4353145202011 |
7 | 506026132141 |
oct | 113367151267 |
9 | 28131455837 |
10 | 10131133111 |
11 | 4329840290 |
12 | 1b68a90307 |
13 | c55c11928 |
14 | 6c1739c91 |
15 | 3e4662341 |
hex | 25bdcd2b7 |
10131133111 has 16 divisors (see below), whose sum is σ = 11138895360. Its totient is φ = 9138064320.
The previous prime is 10131133097. The next prime is 10131133141. The reversal of 10131133111 is 11133113101.
It is not a de Polignac number, because 10131133111 - 25 = 10131133079 is a prime.
It is a super-2 number, since 2×101311331112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131133141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 906091 + ... + 917203.
It is an arithmetic number, because the mean of its divisors is an integer number (696180960).
Almost surely, 210131133111 is an apocalyptic number.
10131133111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10131133111 is a deficient number, since it is larger than the sum of its proper divisors (1007762249).
10131133111 is a wasteful number, since it uses less digits than its factorization.
10131133111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11766.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 10131133111 its reverse (11133113101), we get a palindrome (21264246212).
The spelling of 10131133111 in words is "ten billion, one hundred thirty-one million, one hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •