Base | Representation |
---|---|
bin | 111101001100000001… |
… | …1001001001110100110 |
3 | 110120011111020121001210 |
4 | 1322120003021032212 |
5 | 4123101343324232 |
6 | 140210405332250 |
7 | 12331133254350 |
oct | 1723003111646 |
9 | 416144217053 |
10 | 131399979942 |
11 | 507a9954850 |
12 | 21571707086 |
13 | c510c4712a |
14 | 65073b40d0 |
15 | 3640c025cc |
hex | 1e980c93a6 |
131399979942 has 128 divisors (see below), whose sum is σ = 347527065600. Its totient is φ = 32086454400.
The previous prime is 131399979913. The next prime is 131399979943. The reversal of 131399979942 is 249979993131.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131399979943) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 1092784 + ... + 1207052.
It is an arithmetic number, because the mean of its divisors is an integer number (2715055200).
Almost surely, 2131399979942 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131399979942, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173763532800).
131399979942 is an abundant number, since it is smaller than the sum of its proper divisors (216127085658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131399979942 is a wasteful number, since it uses less digits than its factorization.
131399979942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114442.
The product of its digits is 29760696, while the sum is 66.
The spelling of 131399979942 in words is "one hundred thirty-one billion, three hundred ninety-nine million, nine hundred seventy-nine thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •