Base | Representation |
---|---|
bin | 111101010010010100… |
… | …1111010111010101010 |
3 | 110120201020012110222120 |
4 | 1322210221322322222 |
5 | 4124020014042110 |
6 | 140243402332110 |
7 | 12336312023040 |
oct | 1724451727252 |
9 | 416636173876 |
10 | 131611471530 |
11 | 508a8276590 |
12 | 216104ba036 |
13 | c5459c5b96 |
14 | 6527508390 |
15 | 365457b870 |
hex | 1ea4a7aeaa |
131611471530 has 64 divisors (see below), whose sum is σ = 393808877568. Its totient is φ = 27347837760.
The previous prime is 131611471477. The next prime is 131611471549. The reversal of 131611471530 is 35174116131.
131611471530 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 131611471491 and 131611471500.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28485022 + ... + 28489641.
It is an arithmetic number, because the mean of its divisors is an integer number (6153263712).
Almost surely, 2131611471530 is an apocalyptic number.
131611471530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131611471530 is an abundant number, since it is smaller than the sum of its proper divisors (262197406038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131611471530 is a wasteful number, since it uses less digits than its factorization.
131611471530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56974691.
The product of its (nonzero) digits is 7560, while the sum is 33.
Adding to 131611471530 its reverse (35174116131), we get a palindrome (166785587661).
The spelling of 131611471530 in words is "one hundred thirty-one billion, six hundred eleven million, four hundred seventy-one thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •