Base | Representation |
---|---|
bin | 110001000110101110… |
… | …0111011110110011101 |
3 | 101002012011021100010102 |
4 | 1202031130323312131 |
5 | 3211431302401431 |
6 | 120235534350445 |
7 | 10422131335451 |
oct | 1421534736635 |
9 | 332164240112 |
10 | 105452387741 |
11 | 407a413a778 |
12 | 1852b95b425 |
13 | 9c372c2a8c |
14 | 5165242661 |
15 | 2b22c51dcb |
hex | 188d73bd9d |
105452387741 has 2 divisors, whose sum is σ = 105452387742. Its totient is φ = 105452387740.
The previous prime is 105452387713. The next prime is 105452387743. The reversal of 105452387741 is 147783254501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91942974841 + 13509412900 = 303221^2 + 116230^2 .
It is an emirp because it is prime and its reverse (147783254501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105452387741 is a prime.
It is a super-2 number, since 2×1054523877412 (a number of 23 digits) contains 22 as substring.
Together with 105452387743, 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 (105452387743) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52726193870 + 52726193871.
It is an arithmetic number, because the mean of its divisors is an integer number (52726193871).
Almost surely, 2105452387741 is an apocalyptic number.
It is an amenable number.
105452387741 is a deficient number, since it is larger than the sum of its proper divisors (1).
105452387741 is an equidigital number, since it uses as much as digits as its factorization.
105452387741 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 940800, while the sum is 47.
The spelling of 105452387741 in words is "one hundred five billion, four hundred fifty-two million, three hundred eighty-seven thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •