Base | Representation |
---|---|
bin | 111100110001111000… |
… | …0011100001011011001 |
3 | 110110220100102012112121 |
4 | 1321203300130023121 |
5 | 4114302300132333 |
6 | 135543345341241 |
7 | 12300321214042 |
oct | 1714360341331 |
9 | 413810365477 |
10 | 130522661593 |
11 | 50399704565 |
12 | 21367937821 |
13 | c40126264c |
14 | 6462a7d8c9 |
15 | 35ddba632d |
hex | 1e63c1c2d9 |
130522661593 has 2 divisors, whose sum is σ = 130522661594. Its totient is φ = 130522661592.
The previous prime is 130522661561. The next prime is 130522661617. The reversal of 130522661593 is 395166225031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81115596864 + 49407064729 = 284808^2 + 222277^2 .
It is a cyclic number.
It is not a de Polignac number, because 130522661593 - 25 = 130522661561 is a prime.
It is not a weakly prime, because it can be changed into another prime (130522661993) 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, 65261330796 + 65261330797.
It is an arithmetic number, because the mean of its divisors is an integer number (65261330797).
Almost surely, 2130522661593 is an apocalyptic number.
It is an amenable number.
130522661593 is a deficient number, since it is larger than the sum of its proper divisors (1).
130522661593 is an equidigital number, since it uses as much as digits as its factorization.
130522661593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 291600, while the sum is 43.
The spelling of 130522661593 in words is "one hundred thirty billion, five hundred twenty-two million, six hundred sixty-one thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •