Base | Representation |
---|---|
bin | 111101000011101111… |
… | …1001101110011000100 |
3 | 110112110010102011010210 |
4 | 1322013133031303010 |
5 | 4122014231013040 |
6 | 140123042115420 |
7 | 12321220452534 |
oct | 1720737156304 |
9 | 415403364123 |
10 | 131122126020 |
11 | 50677027006 |
12 | 214b464bb70 |
13 | c498501522 |
14 | 64bc5274c4 |
15 | 362661a480 |
hex | 1e877cdcc4 |
131122126020 has 48 divisors (see below), whose sum is σ = 367159097088. Its totient is φ = 34964267520.
The previous prime is 131122125941. The next prime is 131122126021. The reversal of 131122126020 is 20621221131.
It is a super-3 number, since 3×1311221260203 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (131122126021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1798885 + ... + 1870355.
It is an arithmetic number, because the mean of its divisors is an integer number (7649147856).
Almost surely, 2131122126020 is an apocalyptic number.
131122126020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131122126020 is an abundant number, since it is smaller than the sum of its proper divisors (236036971068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131122126020 is a wasteful number, since it uses less digits than its factorization.
131122126020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102060 (or 102058 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 131122126020 its reverse (20621221131), we get a palindrome (151743347151).
The spelling of 131122126020 in words is "one hundred thirty-one billion, one hundred twenty-two million, one hundred twenty-six thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •