Base | Representation |
---|---|
bin | 100000110100001… |
… | …1001101101110011 |
3 | 2211201221012010201 |
4 | 1001220121231303 |
5 | 4223341011011 |
6 | 301132340031 |
7 | 36200165422 |
oct | 10150315563 |
9 | 2751835121 |
10 | 1101110131 |
11 | 515603380 |
12 | 268914617 |
13 | 14717c074 |
14 | a634b2b9 |
15 | 66a04cc1 |
hex | 41a19b73 |
1101110131 has 8 divisors (see below), whose sum is σ = 1202670000. Its totient is φ = 999793440.
The previous prime is 1101110123. The next prime is 1101110167. The reversal of 1101110131 is 1310111011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1101110131 - 23 = 1101110123 is a prime.
It is a super-2 number, since 2×11011101312 = 2424887041181674322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101110191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51256 + ... + 69493.
It is an arithmetic number, because the mean of its divisors is an integer number (150333750).
Almost surely, 21101110131 is an apocalyptic number.
1101110131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1101110131 is a deficient number, since it is larger than the sum of its proper divisors (101559869).
1101110131 is a wasteful number, since it uses less digits than its factorization.
1101110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121589.
The product of its (nonzero) digits is 3, while the sum is 10.
The square root of 1101110131 is about 33182.9795377088. The cubic root of 1101110131 is about 1032.6272611733.
Adding to 1101110131 its reverse (1310111011), we get a palindrome (2411221142).
The spelling of 1101110131 in words is "one billion, one hundred one million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •