Base | Representation |
---|---|
bin | 1001010010001111010110… |
… | …1110111001100010110001 |
3 | 1100010222010022202111200222 |
4 | 2110203311232321202301 |
5 | 2314230430020220122 |
6 | 33413533410222425 |
7 | 2102400445531442 |
oct | 224436556714261 |
9 | 40128108674628 |
10 | 10208965007537 |
11 | 328666366605a |
12 | 118a695884a15 |
13 | 5909168c548a |
14 | 27418bb172c9 |
15 | 12a85a480b42 |
hex | 948f5bb98b1 |
10208965007537 has 2 divisors, whose sum is σ = 10208965007538. Its totient is φ = 10208965007536.
The previous prime is 10208965007533. The next prime is 10208965007599. The reversal of 10208965007537 is 73570056980201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7086025717681 + 3122939289856 = 2661959^2 + 1767184^2 .
It is a cyclic number.
It is not a de Polignac number, because 10208965007537 - 22 = 10208965007533 is a prime.
It is a super-2 number, since 2×102089650075372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10208965007533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5104482503768 + 5104482503769.
It is an arithmetic number, because the mean of its divisors is an integer number (5104482503769).
Almost surely, 210208965007537 is an apocalyptic number.
It is an amenable number.
10208965007537 is a deficient number, since it is larger than the sum of its proper divisors (1).
10208965007537 is an equidigital number, since it uses as much as digits as its factorization.
10208965007537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3175200, while the sum is 53.
The spelling of 10208965007537 in words is "ten trillion, two hundred eight billion, nine hundred sixty-five million, seven thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •