Base | Representation |
---|---|
bin | 10111011011001001001001… |
… | …101101011010000110100111 |
3 | 111111202122110101101122001211 |
4 | 113123021021231122012213 |
5 | 102000341104440431043 |
6 | 1003034514353332251 |
7 | 30461654423232622 |
oct | 2733111155320647 |
9 | 444678411348054 |
10 | 103020322202023 |
11 | 2a909745170036 |
12 | b67a041567087 |
13 | 4563a0c023055 |
14 | 1b622d2b02db9 |
15 | bd9bdd1c6a9d |
hex | 5db249b5a1a7 |
103020322202023 has 2 divisors, whose sum is σ = 103020322202024. Its totient is φ = 103020322202022.
The previous prime is 103020322201939. The next prime is 103020322202069. The reversal of 103020322202023 is 320202223020301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103020322202023 - 241 = 100821298946471 is a prime.
It is a super-2 number, since 2×1030203222020232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103020322201985 and 103020322202003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103020322202323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51510161101011 + 51510161101012.
It is an arithmetic number, because the mean of its divisors is an integer number (51510161101012).
Almost surely, 2103020322202023 is an apocalyptic number.
103020322202023 is a deficient number, since it is larger than the sum of its proper divisors (1).
103020322202023 is an equidigital number, since it uses as much as digits as its factorization.
103020322202023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 103020322202023 its reverse (320202223020301), we get a palindrome (423222545222324).
The spelling of 103020322202023 in words is "one hundred three trillion, twenty billion, three hundred twenty-two million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •