Base | Representation |
---|---|
bin | 1001011110100011111111… |
… | …1010110101000101110001 |
3 | 1100220012112220222010220012 |
4 | 2113220333322311011301 |
5 | 2331213004214442023 |
6 | 34055104142024305 |
7 | 2123603513264366 |
oct | 227507772650561 |
9 | 40805486863805 |
10 | 10420663046513 |
11 | 3358418695065 |
12 | 1203716b78095 |
13 | 5a78836428b5 |
14 | 28051169246d |
15 | 1310ea8ca978 |
hex | 97a3feb5171 |
10420663046513 has 2 divisors, whose sum is σ = 10420663046514. Its totient is φ = 10420663046512.
The previous prime is 10420663046461. The next prime is 10420663046531. The reversal of 10420663046513 is 31564036602401.
Together with next prime (10420663046531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5658461077504 + 4762201969009 = 2378752^2 + 2182247^2 .
It is a cyclic number.
It is not a de Polignac number, because 10420663046513 - 26 = 10420663046449 is a prime.
It is not a weakly prime, because it can be changed into another prime (10420663046543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5210331523256 + 5210331523257.
It is an arithmetic number, because the mean of its divisors is an integer number (5210331523257).
Almost surely, 210420663046513 is an apocalyptic number.
It is an amenable number.
10420663046513 is a deficient number, since it is larger than the sum of its proper divisors (1).
10420663046513 is an equidigital number, since it uses as much as digits as its factorization.
10420663046513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 311040, while the sum is 41.
Adding to 10420663046513 its reverse (31564036602401), we get a palindrome (41984699648914).
The spelling of 10420663046513 in words is "ten trillion, four hundred twenty billion, six hundred sixty-three million, forty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •