Base | Representation |
---|---|
bin | 10000011101010101101… |
… | …000010111010001101001 |
3 | 11000010100020120121021021 |
4 | 100131111220113101221 |
5 | 122012303314341210 |
6 | 2223325154412441 |
7 | 144466362150265 |
oct | 20352550272151 |
9 | 4003306517237 |
10 | 1131013043305 |
11 | 3a67294174a2 |
12 | 163245b91121 |
13 | 82866cc6382 |
14 | 3ca542970a5 |
15 | 1e6484d5bda |
hex | 10755a17469 |
1131013043305 has 16 divisors (see below), whose sum is σ = 1371026177424. Its totient is φ = 895624468480.
The previous prime is 1131013043249. The next prime is 1131013043471. The reversal of 1131013043305 is 5033403101311.
It can be written as a sum of positive squares in 8 ways, for example, as 702731800681 + 428281242624 = 838291^2 + 654432^2 .
It is a de Polignac number, because none of the positive numbers 2k-1131013043305 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1131013043305.
It is an unprimeable number.
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, 885274 + ... + 1745203.
It is an arithmetic number, because the mean of its divisors is an integer number (85689136089).
Almost surely, 21131013043305 is an apocalyptic number.
It is an amenable number.
1131013043305 is a deficient number, since it is larger than the sum of its proper divisors (240013134119).
1131013043305 is a wasteful number, since it uses less digits than its factorization.
1131013043305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2631356.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 1131013043305 its reverse (5033403101311), we get a palindrome (6164416144616).
The spelling of 1131013043305 in words is "one trillion, one hundred thirty-one billion, thirteen million, forty-three thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •