Base | Representation |
---|---|
bin | 111101000101111101… |
… | …0110010100111000000 |
3 | 110112122022021220001201 |
4 | 1322023322302213000 |
5 | 4122142243313202 |
6 | 140134255310544 |
7 | 12323112353200 |
oct | 1721372624700 |
9 | 415568256051 |
10 | 131196463552 |
11 | 50704a8a990 |
12 | 2151551b454 |
13 | c4aaa2b42b |
14 | 64c8358400 |
15 | 362ce01387 |
hex | 1e8beb29c0 |
131196463552 has 336 divisors, whose sum is σ = 337492604160. Its totient is φ = 50029056000.
The previous prime is 131196463549. The next prime is 131196463571. The reversal of 131196463552 is 255364691131.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 463591603 + ... + 463591885.
Almost surely, 2131196463552 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 131196463552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168746302080).
131196463552 is an abundant number, since it is smaller than the sum of its proper divisors (206296140608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131196463552 is a wasteful number, since it uses less digits than its factorization.
131196463552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560 (or 543 counting only the distinct ones).
The product of its digits is 583200, while the sum is 46.
The spelling of 131196463552 in words is "one hundred thirty-one billion, one hundred ninety-six million, four hundred sixty-three thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •