Base | Representation |
---|---|
bin | 1001101100000111011011… |
… | …0011010011101000111001 |
3 | 1101201110120120110101011122 |
4 | 2123001312303103220321 |
5 | 2344021343041232403 |
6 | 34354053400235025 |
7 | 2146455650224436 |
oct | 233016663235071 |
9 | 41643516411148 |
10 | 10653512055353 |
11 | 3438146900852 |
12 | 124087b76ba75 |
13 | 5c38113532bb |
14 | 28b8c031cb8d |
15 | 1371c7b44838 |
hex | 9b076cd3a39 |
10653512055353 has 2 divisors, whose sum is σ = 10653512055354. Its totient is φ = 10653512055352.
The previous prime is 10653512055299. The next prime is 10653512055377. The reversal of 10653512055353 is 35355021535601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6522752545024 + 4130759510329 = 2553968^2 + 2032427^2 .
It is a cyclic number.
It is not a de Polignac number, because 10653512055353 - 230 = 10652438313529 is a prime.
It is a super-2 number, since 2×106535120553532 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10653512051353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5326756027676 + 5326756027677.
It is an arithmetic number, because the mean of its divisors is an integer number (5326756027677).
Almost surely, 210653512055353 is an apocalyptic number.
It is an amenable number.
10653512055353 is a deficient number, since it is larger than the sum of its proper divisors (1).
10653512055353 is an equidigital number, since it uses as much as digits as its factorization.
10653512055353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1012500, while the sum is 44.
The spelling of 10653512055353 in words is "ten trillion, six hundred fifty-three billion, five hundred twelve million, fifty-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •