Base | Representation |
---|---|
bin | 10110001111101000001101… |
… | …10101011110110001111110 |
3 | 20102012021110002211200210200 |
4 | 23013310012311132301332 |
5 | 22402412414241422100 |
6 | 252011245202544330 |
7 | 13206012423026514 |
oct | 1307640665366176 |
9 | 212167402750720 |
10 | 48915497217150 |
11 | 14649a44a55783 |
12 | 55a01990680a6 |
13 | 213a9334b32a5 |
14 | c117463d44b4 |
15 | 59c60e98be00 |
hex | 2c7d06d5ec7e |
48915497217150 has 144 divisors (see below), whose sum is σ = 135959557406400. Its totient is φ = 12593574362880.
The previous prime is 48915497217091. The next prime is 48915497217193. The reversal of 48915497217150 is 5171279451984.
48915497217150 is a `hidden beast` number, since 4 + 8 + 9 + 1 + 5 + 497 + 21 + 71 + 50 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 234652267 + ... + 234860633.
It is an arithmetic number, because the mean of its divisors is an integer number (944163593100).
Almost surely, 248915497217150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48915497217150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67979778703200).
48915497217150 is an abundant number, since it is smaller than the sum of its proper divisors (87044060189250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48915497217150 is a wasteful number, since it uses less digits than its factorization.
48915497217150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226403 (or 226395 counting only the distinct ones).
The product of its (nonzero) digits is 25401600, while the sum is 63.
The spelling of 48915497217150 in words is "forty-eight trillion, nine hundred fifteen billion, four hundred ninety-seven million, two hundred seventeen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •