Base | Representation |
---|---|
bin | 111101001111011111… |
… | …0101100111100100000 |
3 | 110120110121001000212122 |
4 | 1322132332230330200 |
5 | 4123321130143112 |
6 | 140230121443412 |
7 | 12334044505610 |
oct | 1723676547440 |
9 | 416417030778 |
10 | 131516256032 |
11 | 50859552797 |
12 | 215a4640568 |
13 | c52c069055 |
14 | 6518a00a40 |
15 | 364b01e872 |
hex | 1e9efacf20 |
131516256032 has 48 divisors (see below), whose sum is σ = 305457126912. Its totient is φ = 54545909760.
The previous prime is 131516256013. The next prime is 131516256071. The reversal of 131516256032 is 230652615131.
It is a junction number, because it is equal to n+sod(n) for n = 131516255983 and 131516256001.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9462833 + ... + 9476720.
It is an arithmetic number, because the mean of its divisors is an integer number (6363690144).
Almost surely, 2131516256032 is an apocalyptic number.
It is an amenable number.
131516256032 is an abundant number, since it is smaller than the sum of its proper divisors (173940870880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131516256032 is a wasteful number, since it uses less digits than its factorization.
131516256032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18939601 (or 18939593 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 131516256032 in words is "one hundred thirty-one billion, five hundred sixteen million, two hundred fifty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •