Base | Representation |
---|---|
bin | 10111011011010010010001… |
… | …001011111011011111010111 |
3 | 111111210120201121100100110202 |
4 | 113123102101023323133113 |
5 | 102001021131444220043 |
6 | 1003043214004211115 |
7 | 30462452130325346 |
oct | 2733222113733727 |
9 | 444716647310422 |
10 | 103030111320023 |
11 | 2a91290893a2a8 |
12 | b67bb13999a9b |
13 | 456490c116074 |
14 | 1b62980c4db5d |
15 | bda0b27cb1b8 |
hex | 5db4912fb7d7 |
103030111320023 has 2 divisors, whose sum is σ = 103030111320024. Its totient is φ = 103030111320022.
The previous prime is 103030111320007. The next prime is 103030111320049. The reversal of 103030111320023 is 320023111030301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103030111320023 - 24 = 103030111320007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103030111319977 and 103030111320004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103030111320083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51515055660011 + 51515055660012.
It is an arithmetic number, because the mean of its divisors is an integer number (51515055660012).
Almost surely, 2103030111320023 is an apocalyptic number.
103030111320023 is a deficient number, since it is larger than the sum of its proper divisors (1).
103030111320023 is an equidigital number, since it uses as much as digits as its factorization.
103030111320023 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 103030111320023 its reverse (320023111030301), we get a palindrome (423053222350324).
The spelling of 103030111320023 in words is "one hundred three trillion, thirty billion, one hundred eleven million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •