Base | Representation |
---|---|
bin | 1001100100101111000010… |
… | …00011100001000010110001 |
3 | 2202112200112101012010011122 |
4 | 10302113201003201002301 |
5 | 10224414341042404243 |
6 | 112435445301152025 |
7 | 4302026065445321 |
oct | 462274103410261 |
9 | 82480471163148 |
10 | 21053410513073 |
11 | 6787779411a24 |
12 | 24403606bb615 |
13 | b99435a86363 |
14 | 52adc1d3b281 |
15 | 2679aa5c4668 |
hex | 1325e10e10b1 |
21053410513073 has 2 divisors, whose sum is σ = 21053410513074. Its totient is φ = 21053410513072.
The previous prime is 21053410512929. The next prime is 21053410513099. The reversal of 21053410513073 is 37031501435012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18064132036864 + 2989278476209 = 4250192^2 + 1728953^2 .
It is a cyclic number.
It is not a de Polignac number, because 21053410513073 - 214 = 21053410496689 is a prime.
It is a super-2 number, since 2×210534105130732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21053410513873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10526705256536 + 10526705256537.
It is an arithmetic number, because the mean of its divisors is an integer number (10526705256537).
Almost surely, 221053410513073 is an apocalyptic number.
It is an amenable number.
21053410513073 is a deficient number, since it is larger than the sum of its proper divisors (1).
21053410513073 is an equidigital number, since it uses as much as digits as its factorization.
21053410513073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 37800, while the sum is 35.
Adding to 21053410513073 its reverse (37031501435012), we get a palindrome (58084911948085).
The spelling of 21053410513073 in words is "twenty-one trillion, fifty-three billion, four hundred ten million, five hundred thirteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •