Base | Representation |
---|---|
bin | 10000111011101000011… |
… | …001010110100011110100 |
3 | 11010020022010000210221020 |
4 | 100323220121112203310 |
5 | 123030412233130121 |
6 | 2250304543021140 |
7 | 150030415631034 |
oct | 20735031264364 |
9 | 4106263023836 |
10 | 1163540130036 |
11 | 409500085159 |
12 | 16960329a7b0 |
13 | 8594bab285b |
14 | 4045c1a38c4 |
15 | 203edddb1c6 |
hex | 10ee86568f4 |
1163540130036 has 24 divisors (see below), whose sum is σ = 2715245824704. Its totient is φ = 387801159360.
The previous prime is 1163540130031. The next prime is 1163540130059. The reversal of 1163540130036 is 6300310453611.
It is a super-2 number, since 2×11635401300362 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1163540129979 and 1163540130006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1163540130031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5587320 + ... + 5791823.
It is an arithmetic number, because the mean of its divisors is an integer number (113135242696).
Almost surely, 21163540130036 is an apocalyptic number.
It is an amenable number.
1163540130036 is an abundant number, since it is smaller than the sum of its proper divisors (1551705694668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1163540130036 is a wasteful number, since it uses less digits than its factorization.
1163540130036 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11387671 (or 11387669 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 33.
Adding to 1163540130036 its reverse (6300310453611), we get a palindrome (7463850583647).
The spelling of 1163540130036 in words is "one trillion, one hundred sixty-three billion, five hundred forty million, one hundred thirty thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •