Base | Representation |
---|---|
bin | 111100110001110111… |
… | …0000010010000110001 |
3 | 110110220022020011201222 |
4 | 1321203232002100301 |
5 | 4114302114444103 |
6 | 135543324034425 |
7 | 12300312650033 |
oct | 1714356022061 |
9 | 413808204658 |
10 | 130522031153 |
11 | 50399313938 |
12 | 21367692a15 |
13 | c4010a16c7 |
14 | 6462957c53 |
15 | 35ddace638 |
hex | 1e63b82431 |
130522031153 has 12 divisors (see below), whose sum is σ = 137949945588. Its totient is φ = 123475816800.
The previous prime is 130522031141. The next prime is 130522031161. The reversal of 130522031153 is 351130225031.
It can be written as a sum of positive squares in 2 ways, for example, as 100053281344 + 30468749809 = 316312^2 + 174553^2 .
It is not a de Polignac number, because 130522031153 - 26 = 130522031089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (130522031753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4826 + ... + 510947.
It is an arithmetic number, because the mean of its divisors is an integer number (11495828799).
Almost surely, 2130522031153 is an apocalyptic number.
It is an amenable number.
130522031153 is a deficient number, since it is larger than the sum of its proper divisors (7427914435).
130522031153 is an equidigital number, since it uses as much as digits as its factorization.
130522031153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516512 (or 516493 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 130522031153 its reverse (351130225031), we get a palindrome (481652256184).
The spelling of 130522031153 in words is "one hundred thirty billion, five hundred twenty-two million, thirty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •