Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0110010000011100111101 |
3 | 1111010020122001221011120211 |
4 | 2210320330012100130331 |
5 | 2441122124243000221 |
6 | 40033241123312421 |
7 | 2246435004556366 |
oct | 244707406203475 |
9 | 44106561834524 |
10 | 11331132000061 |
11 | 3679562680685 |
12 | 133007121b711 |
13 | 6426a0cc0b73 |
14 | 2b26031d0b6d |
15 | 149b370496e1 |
hex | a4e3c19073d |
11331132000061 has 2 divisors, whose sum is σ = 11331132000062. Its totient is φ = 11331132000060.
The previous prime is 11331132000031. The next prime is 11331132000079. The reversal of 11331132000061 is 16000023113311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9243089660025 + 2088042340036 = 3040245^2 + 1445006^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331132000061 - 29 = 11331131999549 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11331131999996 and 11331132000041.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331132000031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665566000030 + 5665566000031.
It is an arithmetic number, because the mean of its divisors is an integer number (5665566000031).
Almost surely, 211331132000061 is an apocalyptic number.
It is an amenable number.
11331132000061 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331132000061 is an equidigital number, since it uses as much as digits as its factorization.
11331132000061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 11331132000061 its reverse (16000023113311), we get a palindrome (27331155113372).
The spelling of 11331132000061 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •