Base | Representation |
---|---|
bin | 10101011011101100011110… |
… | …10111110100110000111000 |
3 | 20011212200120002220110112020 |
4 | 22231312033113310300320 |
5 | 22134143423332320303 |
6 | 244123415301514440 |
7 | 12633052064643252 |
oct | 1255661727646070 |
9 | 204780502813466 |
10 | 47131081526328 |
11 | 140211a78a9258 |
12 | 535239ba12a20 |
13 | 203b598b7ab07 |
14 | b8d2296aacd2 |
15 | 56aec31b6a53 |
hex | 2add8f5f4c38 |
47131081526328 has 128 divisors (see below), whose sum is σ = 121067654400000. Its totient is φ = 15283882179072.
The previous prime is 47131081526323. The next prime is 47131081526369. The reversal of 47131081526328 is 82362518013174.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47131081526323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79166553 + ... + 79759671.
It is an arithmetic number, because the mean of its divisors is an integer number (945841050000).
Almost surely, 247131081526328 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 47131081526328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60533827200000).
47131081526328 is an abundant number, since it is smaller than the sum of its proper divisors (73936572873672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47131081526328 is a wasteful number, since it uses less digits than its factorization.
47131081526328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 593709 (or 593705 counting only the distinct ones).
The product of its (nonzero) digits is 1935360, while the sum is 51.
The spelling of 47131081526328 in words is "forty-seven trillion, one hundred thirty-one billion, eighty-one million, five hundred twenty-six thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •