Base | Representation |
---|---|
bin | 111101001010000011… |
… | …0010110101000111000 |
3 | 110112222212112212010212 |
4 | 1322110012112220320 |
5 | 4122432412244230 |
6 | 140200041130252 |
7 | 12326400064550 |
oct | 1722406265070 |
9 | 415885485125 |
10 | 131333712440 |
11 | 50775503017 |
12 | 21553489988 |
13 | c5002b44a8 |
14 | 64dc684160 |
15 | 3639eb2895 |
hex | 1e94196a38 |
131333712440 has 64 divisors (see below), whose sum is σ = 340374528000. Its totient is φ = 44674132608.
The previous prime is 131333712437. The next prime is 131333712479. The reversal of 131333712440 is 44217333131.
It is a super-2 number, since 2×1313337124402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131333712397 and 131333712406.
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, 1811090 + ... + 1882209.
It is an arithmetic number, because the mean of its divisors is an integer number (5318352000).
Almost surely, 2131333712440 is an apocalyptic number.
131333712440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131333712440 is an abundant number, since it is smaller than the sum of its proper divisors (209040815560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131333712440 is a wasteful number, since it uses less digits than its factorization.
131333712440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3693444 (or 3693440 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 32.
The spelling of 131333712440 in words is "one hundred thirty-one billion, three hundred thirty-three million, seven hundred twelve thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •