Base | Representation |
---|---|
bin | 111100110010001000… |
… | …1110010011001011000 |
3 | 110110220221212022222110 |
4 | 1321210101302121120 |
5 | 4114312014401402 |
6 | 135544300552320 |
7 | 12300455423160 |
oct | 1714421623130 |
9 | 413827768873 |
10 | 130531403352 |
11 | 503a3635359 |
12 | 2136a8526a0 |
13 | c40300359c |
14 | 6463cb75a0 |
15 | 35de83156c |
hex | 1e64472658 |
130531403352 has 64 divisors (see below), whose sum is σ = 373706668800. Its totient is φ = 37218706560.
The previous prime is 130531403329. The next prime is 130531403381. The reversal of 130531403352 is 253304135031.
It is a super-2 number, since 2×1305314033522 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 708727 + ... + 873702.
It is an arithmetic number, because the mean of its divisors is an integer number (5839166700).
Almost surely, 2130531403352 is an apocalyptic number.
130531403352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130531403352 is an abundant number, since it is smaller than the sum of its proper divisors (243175265448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130531403352 is a wasteful number, since it uses less digits than its factorization.
130531403352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1582936 (or 1582932 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 130531403352 its reverse (253304135031), we get a palindrome (383835538383).
The spelling of 130531403352 in words is "one hundred thirty billion, five hundred thirty-one million, four hundred three thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •