Base | Representation |
---|---|
bin | 11101100101010110100100… |
… | …010011111111110101100001 |
3 | 122001200102011121122021220211 |
4 | 131211112210103333311201 |
5 | 114023211142424101421 |
6 | 1140415445015534121 |
7 | 36256103033605525 |
oct | 3545264423776541 |
9 | 561612147567824 |
10 | 130110201003361 |
11 | 38503476556117 |
12 | 1271428b08a341 |
13 | 577a4545cac97 |
14 | 241b51dd45d85 |
15 | 10096e91479e1 |
hex | 7655a44ffd61 |
130110201003361 has 2 divisors, whose sum is σ = 130110201003362. Its totient is φ = 130110201003360.
The previous prime is 130110201003331. The next prime is 130110201003397. The reversal of 130110201003361 is 163300102011031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117310127760400 + 12800073242961 = 10830980^2 + 3577719^2 .
It is a cyclic number.
It is not a de Polignac number, because 130110201003361 - 225 = 130110167448929 is a prime.
It is a super-2 number, since 2×1301102010033612 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (130110201003331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65055100501680 + 65055100501681.
It is an arithmetic number, because the mean of its divisors is an integer number (65055100501681).
Almost surely, 2130110201003361 is an apocalyptic number.
It is an amenable number.
130110201003361 is a deficient number, since it is larger than the sum of its proper divisors (1).
130110201003361 is an equidigital number, since it uses as much as digits as its factorization.
130110201003361 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 22.
Adding to 130110201003361 its reverse (163300102011031), we get a palindrome (293410303014392).
The spelling of 130110201003361 in words is "one hundred thirty trillion, one hundred ten billion, two hundred one million, three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •