Base | Representation |
---|---|
bin | 11101110000100111000101… |
… | …011101111101111001100111 |
3 | 122011102101002122022101112101 |
4 | 131300213011131331321213 |
5 | 114123400111423101104 |
6 | 1142211113344232531 |
7 | 36366021564362266 |
oct | 3560470535757147 |
9 | 564371078271471 |
10 | 130883851378279 |
11 | 38781590a7155a |
12 | 1281a20100b747 |
13 | 58053a954c60c |
14 | 2446b529a65dd |
15 | 101e8c90235a4 |
hex | 7709c577de67 |
130883851378279 has 2 divisors, whose sum is σ = 130883851378280. Its totient is φ = 130883851378278.
The previous prime is 130883851378277. The next prime is 130883851378321. The reversal of 130883851378279 is 972873158388031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130883851378279 - 21 = 130883851378277 is a prime.
It is a super-2 number, since 2×1308838513782792 (a number of 29 digits) contains 22 as substring.
Together with 130883851378277, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130883851378277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65441925689139 + 65441925689140.
It is an arithmetic number, because the mean of its divisors is an integer number (65441925689140).
Almost surely, 2130883851378279 is an apocalyptic number.
130883851378279 is a deficient number, since it is larger than the sum of its proper divisors (1).
130883851378279 is an equidigital number, since it uses as much as digits as its factorization.
130883851378279 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 487710720, while the sum is 73.
The spelling of 130883851378279 in words is "one hundred thirty trillion, eight hundred eighty-three billion, eight hundred fifty-one million, three hundred seventy-eight thousand, two hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •