Base | Representation |
---|---|
bin | 10111011100011100101100… |
… | …001000001110111101100011 |
3 | 111112002012222121001121211121 |
4 | 113130130230020032331203 |
5 | 102003323310134343021 |
6 | 1003144031145353111 |
7 | 30501311265010333 |
oct | 2734345410167543 |
9 | 445065877047747 |
10 | 103110020231011 |
11 | 2a943794390902 |
12 | b6934b5198797 |
13 | 456c305407351 |
14 | 1b667a18770c3 |
15 | bdc1dcca5741 |
hex | 5dc72c20ef63 |
103110020231011 has 2 divisors, whose sum is σ = 103110020231012. Its totient is φ = 103110020231010.
The previous prime is 103110020230999. The next prime is 103110020231027. The reversal of 103110020231011 is 110132020011301.
It is a happy number.
It is an a-pointer prime, because the next prime (103110020231027) can be obtained adding 103110020231011 to its sum of digits (16).
It is a weak prime.
It is an emirp because it is prime and its reverse (110132020011301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103110020231011 - 227 = 103109886013283 is a prime.
It is not a weakly prime, because it can be changed into another prime (103110020235011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51555010115505 + 51555010115506.
It is an arithmetic number, because the mean of its divisors is an integer number (51555010115506).
Almost surely, 2103110020231011 is an apocalyptic number.
103110020231011 is a deficient number, since it is larger than the sum of its proper divisors (1).
103110020231011 is an equidigital number, since it uses as much as digits as its factorization.
103110020231011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 103110020231011 its reverse (110132020011301), we get a palindrome (213242040242312).
The spelling of 103110020231011 in words is "one hundred three trillion, one hundred ten billion, twenty million, two hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •