Base | Representation |
---|---|
bin | 1001100110011000111011… |
… | …1110111111100101001001 |
3 | 1101101001122101220012011021 |
4 | 2121212032332333211021 |
5 | 2340413403140234142 |
6 | 34240543355032441 |
7 | 2136404022423565 |
oct | 231461676774511 |
9 | 41331571805137 |
10 | 10555133524297 |
11 | 33aa45278032a |
12 | 12257a4a3b721 |
13 | 5b746375554b |
14 | 286c2a7806a5 |
15 | 13486ae4a267 |
hex | 9998efbf949 |
10555133524297 has 2 divisors, whose sum is σ = 10555133524298. Its totient is φ = 10555133524296.
The previous prime is 10555133524267. The next prime is 10555133524337. The reversal of 10555133524297 is 79242533155501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10463018846281 + 92114678016 = 3234659^2 + 303504^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10555133524297 is a prime.
It is a super-2 number, since 2×105551335242972 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10555133524267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5277566762148 + 5277566762149.
It is an arithmetic number, because the mean of its divisors is an integer number (5277566762149).
Almost surely, 210555133524297 is an apocalyptic number.
It is an amenable number.
10555133524297 is a deficient number, since it is larger than the sum of its proper divisors (1).
10555133524297 is an equidigital number, since it uses as much as digits as its factorization.
10555133524297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5670000, while the sum is 52.
Adding to 10555133524297 its reverse (79242533155501), we get a palindrome (89797666679798).
The spelling of 10555133524297 in words is "ten trillion, five hundred fifty-five billion, one hundred thirty-three million, five hundred twenty-four thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •