Base | Representation |
---|---|
bin | 10000001011000000011… |
… | …111010111100111001101 |
3 | 10221020112120100202201121 |
4 | 100023000133113213031 |
5 | 121202001214323041 |
6 | 2210312144240541 |
7 | 143201550506050 |
oct | 20130037274715 |
9 | 3836476322647 |
10 | 1111331011021 |
11 | 399349424310 |
12 | 15b472610151 |
13 | 80a4b46a91a |
14 | 3bb08300a97 |
15 | 1dd956277d1 |
hex | 102c07d79cd |
1111331011021 has 64 divisors (see below), whose sum is σ = 1492544102400. Its totient is φ = 800948736000.
The previous prime is 1111331011009. The next prime is 1111331011039. The reversal of 1111331011021 is 1201101331111.
It is not a de Polignac number, because 1111331011021 - 219 = 1111330486733 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1111331010986 and 1111331011004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111331011081) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 28884805 + ... + 28923253.
It is an arithmetic number, because the mean of its divisors is an integer number (23321001600).
Almost surely, 21111331011021 is an apocalyptic number.
1111331011021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1111331011021 is a deficient number, since it is larger than the sum of its proper divisors (381213091379).
1111331011021 is a wasteful number, since it uses less digits than its factorization.
1111331011021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38866.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 1111331011021 its reverse (1201101331111), we get a palindrome (2312432342132).
The spelling of 1111331011021 in words is "one trillion, one hundred eleven billion, three hundred thirty-one million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •