Base | Representation |
---|---|
bin | 100001001001001… |
… | …0101000010010011 |
3 | 2212111121120210100 |
4 | 1002102111002103 |
5 | 4234144213021 |
6 | 302204103443 |
7 | 36362463000 |
oct | 10222250223 |
9 | 2774546710 |
10 | 1112101011 |
11 | 52082aa4a |
12 | 270534b83 |
13 | 149529948 |
14 | a79ac8a7 |
15 | 67976626 |
hex | 42495093 |
1112101011 has 48 divisors (see below), whose sum is σ = 1880632000. Its totient is φ = 633007872.
The previous prime is 1112101009. The next prime is 1112101057. The reversal of 1112101011 is 1101012111.
It is not a de Polignac number, because 1112101011 - 21 = 1112101009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112100984 and 1112101002.
It is not an unprimeable number, because it can be changed into a prime (1112181011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1039785 + ... + 1040853.
Almost surely, 21112101011 is an apocalyptic number.
1112101011 is a deficient number, since it is larger than the sum of its proper divisors (768530989).
1112101011 is a wasteful number, since it uses less digits than its factorization.
1112101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1433 (or 1416 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
The square root of 1112101011 is about 33348.1785259705. The cubic root of 1112101011 is about 1036.0516622642.
Adding to 1112101011 its reverse (1101012111), we get a palindrome (2213113122).
Subtracting from 1112101011 its reverse (1101012111), we obtain a square (11088900 = 33302).
The spelling of 1112101011 in words is "one billion, one hundred twelve million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •