Base | Representation |
---|---|
bin | 110001001110001100… |
… | …1111100011110111101 |
3 | 101002211122100002002212 |
4 | 1202130121330132331 |
5 | 3212440013342031 |
6 | 120320455430205 |
7 | 10431265621631 |
oct | 1423431743675 |
9 | 332748302085 |
10 | 105703262141 |
11 | 40912810394 |
12 | 1859b985365 |
13 | 9c77280479 |
14 | 518a6a8dc1 |
15 | 2b39caa12b |
hex | 189c67c7bd |
105703262141 has 2 divisors, whose sum is σ = 105703262142. Its totient is φ = 105703262140.
The previous prime is 105703262123. The next prime is 105703262179. The reversal of 105703262141 is 141262307501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 59228956900 + 46474305241 = 243370^2 + 215579^2 .
It is a cyclic number.
It is not a de Polignac number, because 105703262141 - 214 = 105703245757 is a prime.
It is a super-2 number, since 2×1057032621412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105703262098 and 105703262107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105703262111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52851631070 + 52851631071.
It is an arithmetic number, because the mean of its divisors is an integer number (52851631071).
Almost surely, 2105703262141 is an apocalyptic number.
It is an amenable number.
105703262141 is a deficient number, since it is larger than the sum of its proper divisors (1).
105703262141 is an equidigital number, since it uses as much as digits as its factorization.
105703262141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10080, while the sum is 32.
Adding to 105703262141 its reverse (141262307501), we get a palindrome (246965569642).
The spelling of 105703262141 in words is "one hundred five billion, seven hundred three million, two hundred sixty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •