Base | Representation |
---|---|
bin | 1001101111000011111011… |
… | …0010111100110011001101 |
3 | 1101220022011222021012012221 |
4 | 2123300332302330303031 |
5 | 2400334010140422021 |
6 | 34433222353455341 |
7 | 2153226606105055 |
oct | 233607662746315 |
9 | 41808158235187 |
10 | 10704112045261 |
11 | 3457652215128 |
12 | 124a641571551 |
13 | 5c85164b712b |
14 | 2901205d2565 |
15 | 13868a004241 |
hex | 9bc3ecbcccd |
10704112045261 has 2 divisors, whose sum is σ = 10704112045262. Its totient is φ = 10704112045260.
The previous prime is 10704112045243. The next prime is 10704112045267. The reversal of 10704112045261 is 16254021140701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8096904396036 + 2607207649225 = 2845506^2 + 1614685^2 .
It is a cyclic number.
It is not a de Polignac number, because 10704112045261 - 29 = 10704112044749 is a prime.
It is a super-2 number, since 2×107041120452612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10704112045267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5352056022630 + 5352056022631.
It is an arithmetic number, because the mean of its divisors is an integer number (5352056022631).
Almost surely, 210704112045261 is an apocalyptic number.
It is an amenable number.
10704112045261 is a deficient number, since it is larger than the sum of its proper divisors (1).
10704112045261 is an equidigital number, since it uses as much as digits as its factorization.
10704112045261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13440, while the sum is 34.
Adding to 10704112045261 its reverse (16254021140701), we get a palindrome (26958133185962).
The spelling of 10704112045261 in words is "ten trillion, seven hundred four billion, one hundred twelve million, forty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •