Base | Representation |
---|---|
bin | 110000000001010100… |
… | …1000001001011000001 |
3 | 100212011212002201020122 |
4 | 1200002221001023001 |
5 | 3142144110202431 |
6 | 115212502550025 |
7 | 10310332322225 |
oct | 1400251011301 |
9 | 325155081218 |
10 | 103123522241 |
11 | 3a8095a3643 |
12 | 17b9ba38315 |
13 | 995598215c |
14 | 4dc3c1c785 |
15 | 2a3857ca7b |
hex | 1802a412c1 |
103123522241 has 2 divisors, whose sum is σ = 103123522242. Its totient is φ = 103123522240.
The previous prime is 103123522217. The next prime is 103123522261. The reversal of 103123522241 is 142225321301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 54240081025 + 48883441216 = 232895^2 + 221096^2 .
It is a cyclic number.
It is not a de Polignac number, because 103123522241 - 210 = 103123521217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103123522241.
It is not a weakly prime, because it can be changed into another prime (103123522261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51561761120 + 51561761121.
It is an arithmetic number, because the mean of its divisors is an integer number (51561761121).
Almost surely, 2103123522241 is an apocalyptic number.
It is an amenable number.
103123522241 is a deficient number, since it is larger than the sum of its proper divisors (1).
103123522241 is an equidigital number, since it uses as much as digits as its factorization.
103123522241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 103123522241 its reverse (142225321301), we get a palindrome (245348843542).
The spelling of 103123522241 in words is "one hundred three billion, one hundred twenty-three million, five hundred twenty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •