Base | Representation |
---|---|
bin | 111100111110111100… |
… | …1010011000101001001 |
3 | 110112000220120211010102 |
4 | 1321331321103011021 |
5 | 4121202031104431 |
6 | 140055052455145 |
7 | 12314224521116 |
oct | 1717571230511 |
9 | 415026524112 |
10 | 130961191241 |
11 | 505a41a6361 |
12 | 2146a77a4b5 |
13 | c47107444a |
14 | 64a4dd390d |
15 | 361742adcb |
hex | 1e7de53149 |
130961191241 has 2 divisors, whose sum is σ = 130961191242. Its totient is φ = 130961191240.
The previous prime is 130961191189. The next prime is 130961191243. The reversal of 130961191241 is 142191169031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127291254841 + 3669936400 = 356779^2 + 60580^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130961191241 is a prime.
It is a super-2 number, since 2×1309611912412 (a number of 23 digits) contains 22 as substring.
Together with 130961191243, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 130961191195 and 130961191204.
It is not a weakly prime, because it can be changed into another prime (130961191243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65480595620 + 65480595621.
It is an arithmetic number, because the mean of its divisors is an integer number (65480595621).
Almost surely, 2130961191241 is an apocalyptic number.
It is an amenable number.
130961191241 is a deficient number, since it is larger than the sum of its proper divisors (1).
130961191241 is an equidigital number, since it uses as much as digits as its factorization.
130961191241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 38.
The spelling of 130961191241 in words is "one hundred thirty billion, nine hundred sixty-one million, one hundred ninety-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •