Base | Representation |
---|---|
bin | 111100111110111100… |
… | …1010011000101010001 |
3 | 110112000220120211010201 |
4 | 1321331321103011101 |
5 | 4121202031104444 |
6 | 140055052455201 |
7 | 12314224521130 |
oct | 1717571230521 |
9 | 415026524121 |
10 | 130961191249 |
11 | 505a41a6369 |
12 | 2146a77a501 |
13 | c471074455 |
14 | 64a4dd3917 |
15 | 361742add4 |
hex | 1e7de53151 |
130961191249 has 4 divisors (see below), whose sum is σ = 149669932864. Its totient is φ = 112252449636.
The previous prime is 130961191247. The next prime is 130961191303. The reversal of 130961191249 is 942191169031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130961191249 - 21 = 130961191247 is a prime.
It is a super-2 number, since 2×1309611912492 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130961191199 and 130961191208.
It is not an unprimeable number, because it can be changed into a prime (130961191241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9354370797 + ... + 9354370810.
It is an arithmetic number, because the mean of its divisors is an integer number (37417483216).
Almost surely, 2130961191249 is an apocalyptic number.
It is an amenable number.
130961191249 is a deficient number, since it is larger than the sum of its proper divisors (18708741615).
130961191249 is an equidigital number, since it uses as much as digits as its factorization.
130961191249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18708741614.
The product of its (nonzero) digits is 104976, while the sum is 46.
The spelling of 130961191249 in words is "one hundred thirty billion, nine hundred sixty-one million, one hundred ninety-one thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •