Base | Representation |
---|---|
bin | 11101001001000101100… |
… | …10110000011111011011 |
3 | 10112201120002111202211120 |
4 | 32210202302300133123 |
5 | 112401141121024011 |
6 | 2043555044100323 |
7 | 132225265004322 |
oct | 16444262603733 |
9 | 3481502452746 |
10 | 1001311111131 |
11 | 356721022111 |
12 | 1420890946a3 |
13 | 73566ac4046 |
14 | 3666c61b0b9 |
15 | 1b0a68eda06 |
hex | e922cb07db |
1001311111131 has 16 divisors (see below), whose sum is σ = 1371235615488. Its totient is φ = 649465538400.
The previous prime is 1001311111103. The next prime is 1001311111133. The reversal of 1001311111131 is 1311111131001.
It is a de Polignac number, because none of the positive numbers 2k-1001311111131 is a prime.
It is a super-2 number, since 2×10013111111312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1001311111131.
It is not an unprimeable number, because it can be changed into a prime (1001311111133) 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, 2022696 + ... + 2468586.
It is an arithmetic number, because the mean of its divisors is an integer number (85702225968).
Almost surely, 21001311111131 is an apocalyptic number.
1001311111131 is a deficient number, since it is larger than the sum of its proper divisors (369924504357).
1001311111131 is a wasteful number, since it uses less digits than its factorization.
1001311111131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466162.
The product of its (nonzero) digits is 9, while the sum is 15.
Adding to 1001311111131 its reverse (1311111131001), we get a palindrome (2312422242132).
The spelling of 1001311111131 in words is "one trillion, one billion, three hundred eleven million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •