Base | Representation |
---|---|
bin | 111101001001110001… |
… | …1010111100111000000 |
3 | 110112222020021220210211 |
4 | 1322103203113213000 |
5 | 4122423040311001 |
6 | 140155112403504 |
7 | 12326226120010 |
oct | 1722343274700 |
9 | 415866256724 |
10 | 131324541376 |
11 | 50770309726 |
12 | 215503a6594 |
13 | c4cb423022 |
14 | 64db377c40 |
15 | 36392a0351 |
hex | 1e938d79c0 |
131324541376 has 56 divisors (see below), whose sum is σ = 297860659040. Its totient is φ = 56275264512.
The previous prime is 131324541367. The next prime is 131324541401. The reversal of 131324541376 is 673145423131.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-2 number, since 2×1313245413762 (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 (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6393010 + ... + 6413518.
It is an arithmetic number, because the mean of its divisors is an integer number (5318940340).
Almost surely, 2131324541376 is an apocalyptic number.
131324541376 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
131324541376 is an abundant number, since it is smaller than the sum of its proper divisors (166536117664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131324541376 is a wasteful number, since it uses less digits than its factorization.
131324541376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34821 (or 34811 counting only the distinct ones).
The product of its digits is 181440, while the sum is 40.
The spelling of 131324541376 in words is "one hundred thirty-one billion, three hundred twenty-four million, five hundred forty-one thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •