Base | Representation |
---|---|
bin | 101100111101000110… |
… | …110110110001000000 |
3 | 11121121000020022201221 |
4 | 230331012312301000 |
5 | 1242324040110431 |
6 | 34101434204424 |
7 | 3326112635464 |
oct | 547506666100 |
9 | 147530208657 |
10 | 48269847616 |
11 | 19520085a51 |
12 | 9431583714 |
13 | 4723497013 |
14 | 249ca3a4a4 |
15 | 13c7a37111 |
hex | b3d1b6c40 |
48269847616 has 63 divisors (see below), whose sum is σ = 99307186069. Its totient is φ = 23278078208.
The previous prime is 48269847611. The next prime is 48269847623. The reversal of 48269847616 is 61674896284.
The square root of 48269847616 is 219704.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 25311537216 + 22958310400 = 159096^2 + 151520^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48269847611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 50970855 + ... + 50971801.
Almost surely, 248269847616 is an apocalyptic number.
48269847616 is the 219704-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48269847616
48269847616 is an abundant number, since it is smaller than the sum of its proper divisors (51037338453).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48269847616 is an frugal number, since it uses more digits than its factorization.
48269847616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1964 (or 978 counting only the distinct ones).
The product of its digits is 27869184, while the sum is 61.
The spelling of 48269847616 in words is "forty-eight billion, two hundred sixty-nine million, eight hundred forty-seven thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •