Base | Representation |
---|---|
bin | 10110000011100100000100… |
… | …10010101001001010010000 |
3 | 20100201122110001121001101212 |
4 | 23001302002102221022100 |
5 | 22324114424344203241 |
6 | 251053010515315252 |
7 | 13134035630136212 |
oct | 1301620222511220 |
9 | 210648401531355 |
10 | 48500956631696 |
11 | 144aa15a668308 |
12 | 55339882abb28 |
13 | 210a80b570b3a |
14 | bd965d03a5b2 |
15 | 59194b77bbeb |
hex | 2c1c824a9290 |
48500956631696 has 80 divisors (see below), whose sum is σ = 99152763340800. Its totient is φ = 22919303320704.
The previous prime is 48500956631693. The next prime is 48500956631707. The reversal of 48500956631696 is 69613665900584.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (48500956631693) 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, 245094425 + ... + 245292231.
It is an arithmetic number, because the mean of its divisors is an integer number (1239409541760).
Almost surely, 248500956631696 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 48500956631696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49576381670400).
48500956631696 is an abundant number, since it is smaller than the sum of its proper divisors (50651806709104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48500956631696 is a wasteful number, since it uses less digits than its factorization.
48500956631696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 199756 (or 199750 counting only the distinct ones).
The product of its (nonzero) digits is 251942400, while the sum is 68.
The spelling of 48500956631696 in words is "forty-eight trillion, five hundred billion, nine hundred fifty-six million, six hundred thirty-one thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •