Base | Representation |
---|---|
bin | 110001001100111100… |
… | …1100011010100110011 |
3 | 101002201201012220201021 |
4 | 1202121321203110303 |
5 | 3212343232403201 |
6 | 120312354320311 |
7 | 10430245342366 |
oct | 1423171432463 |
9 | 332651186637 |
10 | 105661216051 |
11 | 408a1002556 |
12 | 18589889097 |
13 | 9c6b64b521 |
14 | 5184c820dd |
15 | 2b36251ea1 |
hex | 1899e63533 |
105661216051 has 2 divisors, whose sum is σ = 105661216052. Its totient is φ = 105661216050.
The previous prime is 105661216021. The next prime is 105661216099. The reversal of 105661216051 is 150612166501.
It is a weak prime.
It is an emirp because it is prime and its reverse (150612166501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105661216051 - 27 = 105661215923 is a prime.
It is a super-2 number, since 2×1056612160512 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105661215998 and 105661216016.
It is not a weakly prime, because it can be changed into another prime (105661216021) 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, 52830608025 + 52830608026.
It is an arithmetic number, because the mean of its divisors is an integer number (52830608026).
Almost surely, 2105661216051 is an apocalyptic number.
105661216051 is a deficient number, since it is larger than the sum of its proper divisors (1).
105661216051 is an equidigital number, since it uses as much as digits as its factorization.
105661216051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 34.
The spelling of 105661216051 in words is "one hundred five billion, six hundred sixty-one million, two hundred sixteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •