Base | Representation |
---|---|
bin | 1001100011100100001011… |
… | …0001011011111010101001 |
3 | 1101012102101201211001101022 |
4 | 2120321002301123322221 |
5 | 2334120014211333143 |
6 | 34202400425102225 |
7 | 2133035411460611 |
oct | 230710261337251 |
9 | 41172351731338 |
10 | 10506610261673 |
11 | 3390912649999 |
12 | 1218302627975 |
13 | 5b29cc921626 |
14 | 284746219a41 |
15 | 13347b057268 |
hex | 98e42c5bea9 |
10506610261673 has 2 divisors, whose sum is σ = 10506610261674. Its totient is φ = 10506610261672.
The previous prime is 10506610261639. The next prime is 10506610261703. The reversal of 10506610261673 is 37616201660501.
10506610261673 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10499362633984 + 7247627689 = 3240272^2 + 85133^2 .
It is a cyclic number.
It is not a de Polignac number, because 10506610261673 - 240 = 9407098633897 is a prime.
It is a super-2 number, since 2×105066102616732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10506610261373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5253305130836 + 5253305130837.
It is an arithmetic number, because the mean of its divisors is an integer number (5253305130837).
Almost surely, 210506610261673 is an apocalyptic number.
It is an amenable number.
10506610261673 is a deficient number, since it is larger than the sum of its proper divisors (1).
10506610261673 is an equidigital number, since it uses as much as digits as its factorization.
10506610261673 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 272160, while the sum is 44.
The spelling of 10506610261673 in words is "ten trillion, five hundred six billion, six hundred ten million, two hundred sixty-one thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •