Base | Representation |
---|---|
bin | 11101100101010110100100… |
… | …010011111111110001011111 |
3 | 122001200102011121122021120021 |
4 | 131211112210103333301133 |
5 | 114023211142424044403 |
6 | 1140415445015533011 |
7 | 36256103033605006 |
oct | 3545264423776137 |
9 | 561612147567507 |
10 | 130110201003103 |
11 | 38503476555a02 |
12 | 1271428b08a167 |
13 | 577a4545cab29 |
14 | 241b51dd45c3d |
15 | 10096e91478bd |
hex | 7655a44ffc5f |
130110201003103 has 2 divisors, whose sum is σ = 130110201003104. Its totient is φ = 130110201003102.
The previous prime is 130110201003059. The next prime is 130110201003127. The reversal of 130110201003103 is 301300102011031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130110201003103 - 233 = 130101611068511 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130110201003163) 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, 65055100501551 + 65055100501552.
It is an arithmetic number, because the mean of its divisors is an integer number (65055100501552).
Almost surely, 2130110201003103 is an apocalyptic number.
130110201003103 is a deficient number, since it is larger than the sum of its proper divisors (1).
130110201003103 is an equidigital number, since it uses as much as digits as its factorization.
130110201003103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 130110201003103 its reverse (301300102011031), we get a palindrome (431410303014134).
The spelling of 130110201003103 in words is "one hundred thirty trillion, one hundred ten billion, two hundred one million, three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •