Base | Representation |
---|---|
bin | 111101000011000101… |
… | …1100101000010010110 |
3 | 110112101121011020211002 |
4 | 1322012023211002112 |
5 | 4121443122413420 |
6 | 140120540143302 |
7 | 12320533215524 |
oct | 1720613450226 |
9 | 415347136732 |
10 | 131100201110 |
11 | 5066571154a |
12 | 214a9237b32 |
13 | c493ac5bc8 |
14 | 64b965b314 |
15 | 3624739075 |
hex | 1e862e5096 |
131100201110 has 32 divisors (see below), whose sum is σ = 244772288640. Its totient is φ = 50496018048.
The previous prime is 131100201103. The next prime is 131100201119. The reversal of 131100201110 is 11102001131.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 131100201091 and 131100201100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131100201119) 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, 497822 + ... + 714161.
It is an arithmetic number, because the mean of its divisors is an integer number (7649134020).
Almost surely, 2131100201110 is an apocalyptic number.
131100201110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131100201110 is a deficient number, since it is larger than the sum of its proper divisors (113672087530).
131100201110 is a wasteful number, since it uses less digits than its factorization.
131100201110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1212392.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 131100201110 its reverse (11102001131), we get a palindrome (142202202241).
The spelling of 131100201110 in words is "one hundred thirty-one billion, one hundred million, two hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •