Base | Representation |
---|---|
bin | 10111011011010010010001… |
… | …001011000110010001001011 |
3 | 111111210120201120221021102211 |
4 | 113123102101023012101023 |
5 | 102001021131420231102 |
6 | 1003043213555405551 |
7 | 30462452125426654 |
oct | 2733222113062113 |
9 | 444716646837384 |
10 | 103030111102027 |
11 | 2a91290880053a |
12 | b67bb138b38b7 |
13 | 456490c06aa85 |
14 | 1b62980bd452b |
15 | bda0b27867d7 |
hex | 5db4912c644b |
103030111102027 has 2 divisors, whose sum is σ = 103030111102028. Its totient is φ = 103030111102026.
The previous prime is 103030111102001. The next prime is 103030111102049. The reversal of 103030111102027 is 720201111030301.
It is an a-pointer prime, because the next prime (103030111102049) can be obtained adding 103030111102027 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103030111102027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103030111101989 and 103030111102007.
It is not a weakly prime, because it can be changed into another prime (103030111102067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51515055551013 + 51515055551014.
It is an arithmetic number, because the mean of its divisors is an integer number (51515055551014).
Almost surely, 2103030111102027 is an apocalyptic number.
103030111102027 is a deficient number, since it is larger than the sum of its proper divisors (1).
103030111102027 is an equidigital number, since it uses as much as digits as its factorization.
103030111102027 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 103030111102027 its reverse (720201111030301), we get a palindrome (823231222132328).
The spelling of 103030111102027 in words is "one hundred three trillion, thirty billion, one hundred eleven million, one hundred two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •