Base | Representation |
---|---|
bin | 1111101100111… |
… | …10111101000000 |
3 | 100011212020002022 |
4 | 13312132331000 |
5 | 232210114242 |
6 | 21023141012 |
7 | 3156425165 |
oct | 766367500 |
9 | 304766068 |
10 | 131723072 |
11 | 68399548 |
12 | 38144768 |
13 | 2139cb60 |
14 | 136cc06c |
15 | b86e0d2 |
hex | 7d9ef40 |
131723072 has 112 divisors (see below), whose sum is σ = 304678080. Its totient is φ = 55959552.
The previous prime is 131723069. The next prime is 131723077. The reversal of 131723072 is 270327131.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131723077) 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, 947579 + ... + 947717.
It is an arithmetic number, because the mean of its divisors is an integer number (2720340).
Almost surely, 2131723072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131723072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152339040).
131723072 is an abundant number, since it is smaller than the sum of its proper divisors (172955008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131723072 is a wasteful number, since it uses less digits than its factorization.
131723072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 248 (or 238 counting only the distinct ones).
The product of its (nonzero) digits is 1764, while the sum is 26.
The square root of 131723072 is about 11477.0672212025. The cubic root of 131723072 is about 508.8080223673.
It can be divided in two parts, 1317 and 23072, that added together give a cube (24389 = 293).
The spelling of 131723072 in words is "one hundred thirty-one million, seven hundred twenty-three thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •