Base | Representation |
---|---|
bin | 1001100011001011111100… |
… | …0100001000111110111101 |
3 | 1101011210121102011020222011 |
4 | 2120302333010020332331 |
5 | 2334013204013330203 |
6 | 34155403143451221 |
7 | 2132415256012261 |
oct | 230627704107675 |
9 | 41153542136864 |
10 | 10500105605053 |
11 | 3389084971119 |
12 | 1216ba8156b11 |
13 | 5b220413009c |
14 | 2842ca3a20a1 |
15 | 1331e9e8676d |
hex | 98cbf108fbd |
10500105605053 has 2 divisors, whose sum is σ = 10500105605054. Its totient is φ = 10500105605052.
The previous prime is 10500105605039. The next prime is 10500105605081. The reversal of 10500105605053 is 35050650100501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10467314914329 + 32790690724 = 3235323^2 + 181082^2 .
It is a cyclic number.
It is not a de Polignac number, because 10500105605053 - 229 = 10499568734141 is a prime.
It is a super-2 number, since 2×105001056050532 (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 (10500105605083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5250052802526 + 5250052802527.
It is an arithmetic number, because the mean of its divisors is an integer number (5250052802527).
Almost surely, 210500105605053 is an apocalyptic number.
It is an amenable number.
10500105605053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10500105605053 is an equidigital number, since it uses as much as digits as its factorization.
10500105605053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11250, while the sum is 31.
Adding to 10500105605053 its reverse (35050650100501), we get a palindrome (45550755705554).
The spelling of 10500105605053 in words is "ten trillion, five hundred billion, one hundred five million, six hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •