Base | Representation |
---|---|
bin | 11101100101100001101011… |
… | …100101011101000111110101 |
3 | 122001201112222021000111022121 |
4 | 131211201223211131013311 |
5 | 114023410112322232331 |
6 | 1140425141101155541 |
7 | 36260004534130132 |
oct | 3545415345350765 |
9 | 561645867014277 |
10 | 130122134180341 |
11 | 3850853a516656 |
12 | 1271665b55bbb1 |
13 | 577b606967054 |
14 | 241bd32b2b589 |
15 | 1009b96ab8c11 |
hex | 76586b95d1f5 |
130122134180341 has 2 divisors, whose sum is σ = 130122134180342. Its totient is φ = 130122134180340.
The previous prime is 130122134180333. The next prime is 130122134180369. The reversal of 130122134180341 is 143081431221031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 65781345724900 + 64340788455441 = 8110570^2 + 8021271^2 .
It is a cyclic number.
It is not a de Polignac number, because 130122134180341 - 23 = 130122134180333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130122134180297 and 130122134180306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130122134181341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65061067090170 + 65061067090171.
It is an arithmetic number, because the mean of its divisors is an integer number (65061067090171).
Almost surely, 2130122134180341 is an apocalyptic number.
It is an amenable number.
130122134180341 is a deficient number, since it is larger than the sum of its proper divisors (1).
130122134180341 is an equidigital number, since it uses as much as digits as its factorization.
130122134180341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 34.
The spelling of 130122134180341 in words is "one hundred thirty trillion, one hundred twenty-two billion, one hundred thirty-four million, one hundred eighty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •