Base | Representation |
---|---|
bin | 1001010100001000000101… |
… | …0010010101111101001101 |
3 | 1100021001202202112201121211 |
4 | 2111002001102111331031 |
5 | 2320243312000244203 |
6 | 33440453153254421 |
7 | 2104625503022146 |
oct | 225020122257515 |
9 | 40231682481554 |
10 | 10241371103053 |
11 | 3299382aa5282 |
12 | 1194a1a564411 |
13 | 5939ac5cb81c |
14 | 27598392aacd |
15 | 12b605436c6d |
hex | 95081495f4d |
10241371103053 has 2 divisors, whose sum is σ = 10241371103054. Its totient is φ = 10241371103052.
The previous prime is 10241371103023. The next prime is 10241371103143. The reversal of 10241371103053 is 35030117314201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10234797460969 + 6573642084 = 3199187^2 + 81078^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10241371103053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10241371103023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5120685551526 + 5120685551527.
It is an arithmetic number, because the mean of its divisors is an integer number (5120685551527).
Almost surely, 210241371103053 is an apocalyptic number.
It is an amenable number.
10241371103053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10241371103053 is an equidigital number, since it uses as much as digits as its factorization.
10241371103053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 31.
Adding to 10241371103053 its reverse (35030117314201), we get a palindrome (45271488417254).
The spelling of 10241371103053 in words is "ten trillion, two hundred forty-one billion, three hundred seventy-one million, one hundred three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •