Base | Representation |
---|---|
bin | 111100110010110100… |
… | …1111111001010101011 |
3 | 110110222120101000000000 |
4 | 1321211221333022223 |
5 | 4114333424234311 |
6 | 135550444314043 |
7 | 12301156101240 |
oct | 1714551771253 |
9 | 413876330000 |
10 | 130554524331 |
11 | 50405697500 |
12 | 21376542923 |
13 | c407a3a43a |
14 | 6466db55c7 |
15 | 35e189c056 |
hex | 1e65a7f2ab |
130554524331 has 240 divisors, whose sum is σ = 253318754304. Its totient is φ = 65819952000.
The previous prime is 130554524299. The next prime is 130554524333. The reversal of 130554524331 is 133425455031.
130554524331 is a `hidden beast` number, since 1 + 30 + 554 + 5 + 2 + 43 + 31 = 666.
It is not a de Polignac number, because 130554524331 - 25 = 130554524299 is a prime.
It is a super-2 number, since 2×1305545243312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130554524333) 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 in 239 ways as a sum of consecutive naturals, for example, 683531446 + ... + 683531636.
Almost surely, 2130554524331 is an apocalyptic number.
130554524331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130554524331 is a deficient number, since it is larger than the sum of its proper divisors (122764229973).
130554524331 is an frugal number, since it uses more digits than its factorization.
130554524331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288 (or 253 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
Adding to 130554524331 its reverse (133425455031), we get a palindrome (263979979362).
The spelling of 130554524331 in words is "one hundred thirty billion, five hundred fifty-four million, five hundred twenty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •