Base | Representation |
---|---|
bin | 111101001100101111… |
… | …1101010001111111000 |
3 | 110120020011212202020110 |
4 | 1322121133222033320 |
5 | 4123124100414230 |
6 | 140213033224320 |
7 | 12331546354344 |
oct | 1723137521770 |
9 | 416204782213 |
10 | 131424232440 |
11 | 5081160a036 |
12 | 215798620a0 |
13 | c515c89017 |
14 | 650a6c8624 |
15 | 3642de34b0 |
hex | 1e997ea3f8 |
131424232440 has 32 divisors (see below), whose sum is σ = 394272697680. Its totient is φ = 35046461952.
The previous prime is 131424232409. The next prime is 131424232477. The reversal of 131424232440 is 44232424131.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 131424232398 and 131424232407.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 547600849 + ... + 547601088.
Almost surely, 2131424232440 is an apocalyptic number.
131424232440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131424232440 is an abundant number, since it is smaller than the sum of its proper divisors (262848465240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131424232440 is a wasteful number, since it uses less digits than its factorization.
131424232440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1095201951 (or 1095201947 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 131424232440 its reverse (44232424131), we get a palindrome (175656656571).
The spelling of 131424232440 in words is "one hundred thirty-one billion, four hundred twenty-four million, two hundred thirty-two thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •