Base | Representation |
---|---|
bin | 10000000001011111011… |
… | …001000001000000100111 |
3 | 10220021011101112021210212 |
4 | 100001133121001000213 |
5 | 121020034134133111 |
6 | 2201502140010035 |
7 | 142360403515241 |
oct | 20013731010047 |
9 | 3807141467725 |
10 | 1101112021031 |
11 | 394a85036940 |
12 | 1594a023091b |
13 | 7cab02a7699 |
14 | 3b419055091 |
15 | 1d99840d98b |
hex | 1005f641027 |
1101112021031 has 16 divisors (see below), whose sum is σ = 1254458354688. Its totient is φ = 956710629600.
The previous prime is 1101112020989. The next prime is 1101112021033. The reversal of 1101112021031 is 1301202111011.
It is not a de Polignac number, because 1101112021031 - 210 = 1101112020007 is a prime.
It is a super-2 number, since 2×11011120210312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101112020997 and 1101112021015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101112021033) 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, 1456316 + ... + 2079201.
It is an arithmetic number, because the mean of its divisors is an integer number (78403647168).
Almost surely, 21101112021031 is an apocalyptic number.
1101112021031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1101112021031 is a deficient number, since it is larger than the sum of its proper divisors (153346333657).
1101112021031 is a wasteful number, since it uses less digits than its factorization.
1101112021031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3536782.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1101112021031 its reverse (1301202111011), we get a palindrome (2402314132042).
The spelling of 1101112021031 in words is "one trillion, one hundred one billion, one hundred twelve million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •