Base | Representation |
---|---|
bin | 1001100100010001000110… |
… | …1011111101010111101101 |
3 | 1101020120112022102202122111 |
4 | 2121010101223331113231 |
5 | 2334314214420103031 |
6 | 34212113330244021 |
7 | 2133643326520153 |
oct | 231042153752755 |
9 | 41216468382574 |
10 | 10518671644141 |
11 | 3395a41a16081 |
12 | 121a709a26611 |
13 | 5b3ba26c842b |
14 | 28516c0553d3 |
15 | 133934da01b1 |
hex | 99111afd5ed |
10518671644141 has 2 divisors, whose sum is σ = 10518671644142. Its totient is φ = 10518671644140.
The previous prime is 10518671644139. The next prime is 10518671644211. The reversal of 10518671644141 is 14144617681501.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10429321466916 + 89350177225 = 3229446^2 + 298915^2 .
It is a cyclic number.
It is not a de Polignac number, because 10518671644141 - 21 = 10518671644139 is a prime.
It is a super-2 number, since 2×105186716441412 (a number of 27 digits) contains 22 as substring.
Together with 10518671644139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10518671644441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5259335822070 + 5259335822071.
It is an arithmetic number, because the mean of its divisors is an integer number (5259335822071).
Almost surely, 210518671644141 is an apocalyptic number.
It is an amenable number.
10518671644141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10518671644141 is an equidigital number, since it uses as much as digits as its factorization.
10518671644141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 645120, while the sum is 49.
The spelling of 10518671644141 in words is "ten trillion, five hundred eighteen billion, six hundred seventy-one million, six hundred forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •