Base | Representation |
---|---|
bin | 11101100110110010110000… |
… | …110011001011001000110111 |
3 | 122002000212200122211200202202 |
4 | 131212302300303023020313 |
5 | 114031321412324004034 |
6 | 1140533140035255115 |
7 | 36266206141561343 |
oct | 3546626063131067 |
9 | 562025618750682 |
10 | 130209194750519 |
11 | 385414559875a5 |
12 | 1272b4b7a4a49b |
13 | 578689c7c1431 |
14 | 24222314ac623 |
15 | 100c08ed6847e |
hex | 766cb0ccb237 |
130209194750519 has 2 divisors, whose sum is σ = 130209194750520. Its totient is φ = 130209194750518.
The previous prime is 130209194750441. The next prime is 130209194750539. The reversal of 130209194750519 is 915057491902031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130209194750519 - 28 = 130209194750263 is a prime.
It is a super-2 number, since 2×1302091947505192 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130209194750539) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65104597375259 + 65104597375260.
It is an arithmetic number, because the mean of its divisors is an integer number (65104597375260).
Almost surely, 2130209194750519 is an apocalyptic number.
130209194750519 is a deficient number, since it is larger than the sum of its proper divisors (1).
130209194750519 is an equidigital number, since it uses as much as digits as its factorization.
130209194750519 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3061800, while the sum is 56.
The spelling of 130209194750519 in words is "one hundred thirty trillion, two hundred nine billion, one hundred ninety-four million, seven hundred fifty thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •