Base | Representation |
---|---|
bin | 110001000110011011… |
… | …0111010110101010101 |
3 | 101002011110112000211122 |
4 | 1202030312322311111 |
5 | 3211421230001401 |
6 | 120234541013325 |
7 | 10421650541222 |
oct | 1421466726525 |
9 | 332143460748 |
10 | 105442422101 |
11 | 40799553405 |
12 | 18528554245 |
13 | 9c35213a53 |
14 | 5163baa949 |
15 | 2b21e3421b |
hex | 188cdbad55 |
105442422101 has 2 divisors, whose sum is σ = 105442422102. Its totient is φ = 105442422100.
The previous prime is 105442422073. The next prime is 105442422103. The reversal of 105442422101 is 101224244501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102127541476 + 3314880625 = 319574^2 + 57575^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105442422101 is a prime.
It is a super-2 number, since 2×1054424221012 (a number of 23 digits) contains 22 as substring.
Together with 105442422103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105442422103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52721211050 + 52721211051.
It is an arithmetic number, because the mean of its divisors is an integer number (52721211051).
Almost surely, 2105442422101 is an apocalyptic number.
It is an amenable number.
105442422101 is a deficient number, since it is larger than the sum of its proper divisors (1).
105442422101 is an equidigital number, since it uses as much as digits as its factorization.
105442422101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2560, while the sum is 26.
Adding to 105442422101 its reverse (101224244501), we get a palindrome (206666666602).
The spelling of 105442422101 in words is "one hundred five billion, four hundred forty-two million, four hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •