Base | Representation |
---|---|
bin | 1100010010110… |
… | …00011011000111 |
3 | 21012001011122201 |
4 | 12021120123013 |
5 | 202344411011 |
6 | 14122135331 |
7 | 2361346033 |
oct | 611303307 |
9 | 235034581 |
10 | 103122631 |
11 | 53234617 |
12 | 2a651547 |
13 | 18497c11 |
14 | d9a51c3 |
15 | 90becc1 |
hex | 62586c7 |
103122631 has 2 divisors, whose sum is σ = 103122632. Its totient is φ = 103122630.
The previous prime is 103122599. The next prime is 103122661. The reversal of 103122631 is 136221301.
It is a strong prime.
It is an emirp because it is prime and its reverse (136221301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103122631 - 25 = 103122599 is a prime.
It is a super-2 number, since 2×1031226312 = 21268554048724322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103122599 and 103122608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103122661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51561315 + 51561316.
It is an arithmetic number, because the mean of its divisors is an integer number (51561316).
Almost surely, 2103122631 is an apocalyptic number.
103122631 is a deficient number, since it is larger than the sum of its proper divisors (1).
103122631 is an equidigital number, since it uses as much as digits as its factorization.
103122631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 103122631 is about 10154.9313636282. The cubic root of 103122631 is about 468.9407729320.
Adding to 103122631 its reverse (136221301), we get a palindrome (239343932).
The spelling of 103122631 in words is "one hundred three million, one hundred twenty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •