Base | Representation |
---|---|
bin | 11101110001100001110001… |
… | …001110011100110001101101 |
3 | 122011122101201222220202000222 |
4 | 131301201301032130301231 |
5 | 114130413133302034431 |
6 | 1142300054100101125 |
7 | 36403412216354012 |
oct | 3561416116346155 |
9 | 564571658822028 |
10 | 130946862533741 |
11 | 387a6286139251 |
12 | 1282a4673947a5 |
13 | 580b30ba987a7 |
14 | 2449c0d327709 |
15 | 1021365cc057b |
hex | 77187139cc6d |
130946862533741 has 2 divisors, whose sum is σ = 130946862533742. Its totient is φ = 130946862533740.
The previous prime is 130946862533687. The next prime is 130946862533791. The reversal of 130946862533741 is 147335268649031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130618132311241 + 328730222500 = 11428829^2 + 573350^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130946862533741 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130946862533791) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65473431266870 + 65473431266871.
It is an arithmetic number, because the mean of its divisors is an integer number (65473431266871).
It is a 4-persistent number, because k⋅130946862533741 is pandigital for 1 ≤ k ≤ 4, but not for k = 5.
Almost surely, 2130946862533741 is an apocalyptic number.
It is an amenable number.
130946862533741 is a deficient number, since it is larger than the sum of its proper divisors (1).
130946862533741 is an equidigital number, since it uses as much as digits as its factorization.
130946862533741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78382080, while the sum is 62.
The spelling of 130946862533741 in words is "one hundred thirty trillion, nine hundred forty-six billion, eight hundred sixty-two million, five hundred thirty-three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •