Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0010100100011000110001 |
3 | 1111010020122000010001012211 |
4 | 2210320330002210120301 |
5 | 2441122124021030022 |
6 | 40033241050452121 |
7 | 2246434663421356 |
oct | 244707402443061 |
9 | 44106560101184 |
10 | 11331131033137 |
11 | 3679562080173 |
12 | 1330070a34041 |
13 | 6426a0a42a16 |
14 | 2b260301c62d |
15 | 149b36e07e77 |
hex | a4e3c0a4631 |
11331131033137 has 2 divisors, whose sum is σ = 11331131033138. Its totient is φ = 11331131033136.
The previous prime is 11331131033119. The next prime is 11331131033141. The reversal of 11331131033137 is 73133013113311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6674322407841 + 4656808625296 = 2583471^2 + 2157964^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331131033137 - 239 = 10781375219249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11331131033099 and 11331131033108.
It is not a weakly prime, because it can be changed into another prime (11331131033147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665565516568 + 5665565516569.
It is an arithmetic number, because the mean of its divisors is an integer number (5665565516569).
Almost surely, 211331131033137 is an apocalyptic number.
It is an amenable number.
11331131033137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331131033137 is an equidigital number, since it uses as much as digits as its factorization.
11331131033137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5103, while the sum is 31.
Adding to 11331131033137 its reverse (73133013113311), we get a palindrome (84464144146448).
The spelling of 11331131033137 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, thirty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •