Base | Representation |
---|---|
bin | 1111101001100… |
… | …00010000110000 |
3 | 100011000012011000 |
4 | 13310300100300 |
5 | 232101112210 |
6 | 21005322000 |
7 | 3152526303 |
oct | 764602060 |
9 | 304005130 |
10 | 131269680 |
11 | 68109943 |
12 | 37b66300 |
13 | 21271689 |
14 | 13610b3a |
15 | b7ceac0 |
hex | 7d30430 |
131269680 has 80 divisors (see below), whose sum is σ = 452158560. Its totient is φ = 35004672.
The previous prime is 131269627. The next prime is 131269693. The reversal of 131269680 is 86962131.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-3 number, since 3×1312696803 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28227 + ... + 32546.
It is an arithmetic number, because the mean of its divisors is an integer number (5651982).
Almost surely, 2131269680 is an apocalyptic number.
131269680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131269680 is an abundant number, since it is smaller than the sum of its proper divisors (320888880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131269680 is a wasteful number, since it uses less digits than its factorization.
131269680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60795 (or 60783 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 131269680 is about 11457.2981108113. The cubic root of 131269680 is about 508.2235773670.
The spelling of 131269680 in words is "one hundred thirty-one million, two hundred sixty-nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •