Base | Representation |
---|---|
bin | 11101110001001000001000… |
… | …010101101000100100101001 |
3 | 122011112202200102020210221221 |
4 | 131301020020111220210221 |
5 | 114124440243222134414 |
6 | 1142235302234502041 |
7 | 36401416055262031 |
oct | 3561101025504451 |
9 | 564482612223857 |
10 | 130919333005609 |
11 | 38795639470305 |
12 | 12825063894921 |
13 | 5808842494885 |
14 | 244875b0448c1 |
15 | 10207a3edd224 |
hex | 771208568929 |
130919333005609 has 2 divisors, whose sum is σ = 130919333005610. Its totient is φ = 130919333005608.
The previous prime is 130919333005607. The next prime is 130919333005631. The reversal of 130919333005609 is 906500333919031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73062696619584 + 57856636386025 = 8547672^2 + 7606355^2 .
It is a cyclic number.
It is not a de Polignac number, because 130919333005609 - 21 = 130919333005607 is a prime.
Together with 130919333005607, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (130919333005607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65459666502804 + 65459666502805.
It is an arithmetic number, because the mean of its divisors is an integer number (65459666502805).
Almost surely, 2130919333005609 is an apocalyptic number.
It is an amenable number.
130919333005609 is a deficient number, since it is larger than the sum of its proper divisors (1).
130919333005609 is an equidigital number, since it uses as much as digits as its factorization.
130919333005609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1771470, while the sum is 52.
The spelling of 130919333005609 in words is "one hundred thirty trillion, nine hundred nineteen billion, three hundred thirty-three million, five thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •