Base | Representation |
---|---|
bin | 100000110101111… |
… | …0101101011111011 |
3 | 2211210121222002002 |
4 | 1001223311223323 |
5 | 4224103324011 |
6 | 301203531215 |
7 | 36210640304 |
oct | 10153655373 |
9 | 2753558062 |
10 | 1102011131 |
11 | 516069301 |
12 | 269089b0b |
13 | 1474061c0 |
14 | a65037ab |
15 | 66b31c3b |
hex | 41af5afb |
1102011131 has 16 divisors (see below), whose sum is σ = 1199407104. Its totient is φ = 1006465824.
The previous prime is 1102011091. The next prime is 1102011187. The reversal of 1102011131 is 1311102011.
It is a happy number.
It is not a de Polignac number, because 1102011131 - 26 = 1102011067 is a prime.
It is a super-2 number, since 2×11020111312 = 2428857065695798322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1102011331) 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 15 ways as a sum of consecutive naturals, for example, 829790 + ... + 831116.
It is an arithmetic number, because the mean of its divisors is an integer number (74962944).
Almost surely, 21102011131 is an apocalyptic number.
1102011131 is a deficient number, since it is larger than the sum of its proper divisors (97395973).
1102011131 is a wasteful number, since it uses less digits than its factorization.
1102011131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1970.
The product of its (nonzero) digits is 6, while the sum is 11.
The square root of 1102011131 is about 33196.5529987678. The cubic root of 1102011131 is about 1032.9088386713.
Adding to 1102011131 its reverse (1311102011), we get a palindrome (2413113142).
It can be divided in two parts, 1102011 and 131, that multiplied together give a palindrome (144363441).
The spelling of 1102011131 in words is "one billion, one hundred two million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •