Base | Representation |
---|---|
bin | 110000011000110110… |
… | …1111001100010001111 |
3 | 100221012220021010221122 |
4 | 1200301231321202033 |
5 | 3200303303041311 |
6 | 115423115151155 |
7 | 10336032511202 |
oct | 1406155714217 |
9 | 327186233848 |
10 | 103913330831 |
11 | 40084403512 |
12 | 181804454bb |
13 | 9a504a730b |
14 | 505aa93939 |
15 | 2a82a900db |
hex | 1831b7988f |
103913330831 has 2 divisors, whose sum is σ = 103913330832. Its totient is φ = 103913330830.
The previous prime is 103913330813. The next prime is 103913330881. The reversal of 103913330831 is 138033319301.
It is a happy number.
Together with previous prime (103913330813) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103913330831 - 218 = 103913068687 is a prime.
It is a super-2 number, since 2×1039133308312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103913330791 and 103913330800.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103913330881) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51956665415 + 51956665416.
It is an arithmetic number, because the mean of its divisors is an integer number (51956665416).
Almost surely, 2103913330831 is an apocalyptic number.
103913330831 is a deficient number, since it is larger than the sum of its proper divisors (1).
103913330831 is an equidigital number, since it uses as much as digits as its factorization.
103913330831 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 35.
The spelling of 103913330831 in words is "one hundred three billion, nine hundred thirteen million, three hundred thirty thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •