Base | Representation |
---|---|
bin | 111101001101010000… |
… | …0011101000011100000 |
3 | 110120021100211200201101 |
4 | 1322122200131003200 |
5 | 4123142422432020 |
6 | 140214441244144 |
7 | 12332143626256 |
oct | 1723240350340 |
9 | 416240750641 |
10 | 131441217760 |
11 | 50820160396 |
12 | 21583493654 |
13 | c5196551c8 |
14 | 650ca6a5d6 |
15 | 364464b00a |
hex | 1e9a81d0e0 |
131441217760 has 96 divisors (see below), whose sum is σ = 319614742944. Its totient is φ = 51050496000.
The previous prime is 131441217727. The next prime is 131441217769. The reversal of 131441217760 is 67712144131.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131441217769) 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, 1336680 + ... + 1431640.
It is an arithmetic number, because the mean of its divisors is an integer number (3329320239).
Almost surely, 2131441217760 is an apocalyptic number.
131441217760 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131441217760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159807371472).
131441217760 is an abundant number, since it is smaller than the sum of its proper divisors (188173525184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131441217760 is a wasteful number, since it uses less digits than its factorization.
131441217760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95228 (or 95220 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 37.
The spelling of 131441217760 in words is "one hundred thirty-one billion, four hundred forty-one million, two hundred seventeen thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •