Base | Representation |
---|---|
bin | 1010101010110100001100… |
… | …0101111111100111010101 |
3 | 1112112102221100111010122211 |
4 | 2222231003011333213111 |
5 | 3014143413410031013 |
6 | 40541000044153421 |
7 | 2320341135051043 |
oct | 252550305774725 |
9 | 45472840433584 |
10 | 11730681330133 |
11 | 3812a54879a97 |
12 | 1395599538871 |
13 | 6712771595bc |
14 | 2c7aa759d393 |
15 | 15521e0c123d |
hex | aab4317f9d5 |
11730681330133 has 2 divisors, whose sum is σ = 11730681330134. Its totient is φ = 11730681330132.
The previous prime is 11730681330107. The next prime is 11730681330163. The reversal of 11730681330133 is 33103318603711.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9101607170769 + 2629074159364 = 3016887^2 + 1621442^2 .
It is an emirp because it is prime and its reverse (33103318603711) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11730681330133 - 229 = 11730144459221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11730681330163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5865340665066 + 5865340665067.
It is an arithmetic number, because the mean of its divisors is an integer number (5865340665067).
Almost surely, 211730681330133 is an apocalyptic number.
It is an amenable number.
11730681330133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11730681330133 is an equidigital number, since it uses as much as digits as its factorization.
11730681330133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 40.
Adding to 11730681330133 its reverse (33103318603711), we get a palindrome (44833999933844).
The spelling of 11730681330133 in words is "eleven trillion, seven hundred thirty billion, six hundred eighty-one million, three hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •