Base | Representation |
---|---|
bin | 1001001111100110000001… |
… | …1100001001000010101101 |
3 | 1022222121210112021222100012 |
4 | 2103321200130021002231 |
5 | 2313004332204042031 |
6 | 33341015144543005 |
7 | 2066201160536315 |
oct | 223714034110255 |
9 | 38877715258305 |
10 | 10163510612141 |
11 | 3269358862027 |
12 | 118190b181a65 |
13 | 589551808b23 |
14 | 271cb8da4445 |
15 | 129599bd6b2b |
hex | 93e607090ad |
10163510612141 has 2 divisors, whose sum is σ = 10163510612142. Its totient is φ = 10163510612140.
The previous prime is 10163510612117. The next prime is 10163510612153. The reversal of 10163510612141 is 14121601536101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9906466682116 + 257043930025 = 3147454^2 + 506995^2 .
It is a cyclic number.
It is not a de Polignac number, because 10163510612141 - 210 = 10163510611117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10163510612098 and 10163510612107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10163510642141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5081755306070 + 5081755306071.
It is an arithmetic number, because the mean of its divisors is an integer number (5081755306071).
Almost surely, 210163510612141 is an apocalyptic number.
It is an amenable number.
10163510612141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10163510612141 is an equidigital number, since it uses as much as digits as its factorization.
10163510612141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 32.
The spelling of 10163510612141 in words is "ten trillion, one hundred sixty-three billion, five hundred ten million, six hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •