Base | Representation |
---|---|
bin | 10111011011000000011110… |
… | …101011011100010101110111 |
3 | 111111201202102102110121211202 |
4 | 113123000132223130111313 |
5 | 102000213022121111043 |
6 | 1003030334351523115 |
7 | 30461204602523603 |
oct | 2733003653342567 |
9 | 444652372417752 |
10 | 103011010332023 |
11 | 2a9057a6928302 |
12 | b678282b2949b |
13 | 4562b86a7a1c1 |
14 | 1b61a8c108503 |
15 | bd98459441b8 |
hex | 5db01eadc577 |
103011010332023 has 2 divisors, whose sum is σ = 103011010332024. Its totient is φ = 103011010332022.
The previous prime is 103011010332011. The next prime is 103011010332031. The reversal of 103011010332023 is 320233010110301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103011010332023 - 28 = 103011010331767 is a prime.
It is a super-2 number, since 2×1030110103320232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103011010331986 and 103011010332004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103011010332523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51505505166011 + 51505505166012.
It is an arithmetic number, because the mean of its divisors is an integer number (51505505166012).
Almost surely, 2103011010332023 is an apocalyptic number.
103011010332023 is a deficient number, since it is larger than the sum of its proper divisors (1).
103011010332023 is an equidigital number, since it uses as much as digits as its factorization.
103011010332023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 103011010332023 its reverse (320233010110301), we get a palindrome (423244020442324).
The spelling of 103011010332023 in words is "one hundred three trillion, eleven billion, ten million, three hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •