Base | Representation |
---|---|
bin | 1001111111111111110011… |
… | …0101010100111000011101 |
3 | 1102221010011212002121121022 |
4 | 2133333330311110320131 |
5 | 2420120342131214221 |
6 | 35215021241413525 |
7 | 2213236625504066 |
oct | 237777465247035 |
9 | 42833155077538 |
10 | 10995063148061 |
11 | 3559a86562a93 |
12 | 1296b0049a2a5 |
13 | 619aa36a52a5 |
14 | 2a0241a3156d |
15 | 1410180784ab |
hex | 9fffcd54e1d |
10995063148061 has 2 divisors, whose sum is σ = 10995063148062. Its totient is φ = 10995063148060.
The previous prime is 10995063147889. The next prime is 10995063148081. The reversal of 10995063148061 is 16084136059901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9213956702500 + 1781106445561 = 3035450^2 + 1334581^2 .
It is a cyclic number.
It is not a de Polignac number, because 10995063148061 - 210 = 10995063147037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10995063147994 and 10995063148012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10995063148081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5497531574030 + 5497531574031.
It is an arithmetic number, because the mean of its divisors is an integer number (5497531574031).
Almost surely, 210995063148061 is an apocalyptic number.
It is an amenable number.
10995063148061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10995063148061 is an equidigital number, since it uses as much as digits as its factorization.
10995063148061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 53.
The spelling of 10995063148061 in words is "ten trillion, nine hundred ninety-five billion, sixty-three million, one hundred forty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •