Base | Representation |
---|---|
bin | 1001101100000111001010… |
… | …1000010001101111111001 |
3 | 1101201110101200201222221221 |
4 | 2123001302220101233321 |
5 | 2344021222131231121 |
6 | 34354042420032041 |
7 | 2146454140230313 |
oct | 233016250215771 |
9 | 41643350658857 |
10 | 10653442055161 |
11 | 343811033a654 |
12 | 1240860232621 |
13 | 5c37cc9b4679 |
14 | 28b8b4cda7b3 |
15 | 1371c1918b41 |
hex | 9b072a11bf9 |
10653442055161 has 2 divisors, whose sum is σ = 10653442055162. Its totient is φ = 10653442055160.
The previous prime is 10653442055119. The next prime is 10653442055171. The reversal of 10653442055161 is 16155024435601.
10653442055161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10134258399225 + 519183655936 = 3183435^2 + 720544^2 .
It is a cyclic number.
It is not a de Polignac number, because 10653442055161 - 29 = 10653442054649 is a prime.
It is a super-2 number, since 2×106534420551612 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10653442055171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5326721027580 + 5326721027581.
It is an arithmetic number, because the mean of its divisors is an integer number (5326721027581).
Almost surely, 210653442055161 is an apocalyptic number.
It is an amenable number.
10653442055161 is a deficient number, since it is larger than the sum of its proper divisors (1).
10653442055161 is an equidigital number, since it uses as much as digits as its factorization.
10653442055161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432000, while the sum is 43.
The spelling of 10653442055161 in words is "ten trillion, six hundred fifty-three billion, four hundred forty-two million, fifty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •