Base | Representation |
---|---|
bin | 111100110100010110… |
… | …1111101010101011101 |
3 | 110111010011001000010102 |
4 | 1321220231331111131 |
5 | 4114440102201203 |
6 | 135555521350445 |
7 | 12302351544032 |
oct | 1715055752535 |
9 | 414104030112 |
10 | 130605897053 |
11 | 504316955a5 |
12 | 2138b798425 |
13 | c4155865b8 |
14 | 646db49389 |
15 | 35e6148888 |
hex | 1e68b7d55d |
130605897053 has 2 divisors, whose sum is σ = 130605897054. Its totient is φ = 130605897052.
The previous prime is 130605897041. The next prime is 130605897091. The reversal of 130605897053 is 350798506031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85344611044 + 45261286009 = 292138^2 + 212747^2 .
It is an emirp because it is prime and its reverse (350798506031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130605897053 - 28 = 130605896797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130605896989 and 130605897007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130605890053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65302948526 + 65302948527.
It is an arithmetic number, because the mean of its divisors is an integer number (65302948527).
Almost surely, 2130605897053 is an apocalyptic number.
It is an amenable number.
130605897053 is a deficient number, since it is larger than the sum of its proper divisors (1).
130605897053 is an equidigital number, since it uses as much as digits as its factorization.
130605897053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 680400, while the sum is 47.
The spelling of 130605897053 in words is "one hundred thirty billion, six hundred five million, eight hundred ninety-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •