Base | Representation |
---|---|
bin | 101101011000111011… |
… | …111011000100010000 |
3 | 11122210112210002202100 |
4 | 231120323323010100 |
5 | 1244303101244241 |
6 | 34220033320400 |
7 | 3343512325524 |
oct | 553073730420 |
9 | 148715702670 |
10 | 48736743696 |
11 | 1973a691983 |
12 | 9541a06100 |
13 | 479912b3a4 |
14 | 2504a55d84 |
15 | 1403a119b6 |
hex | b58efb110 |
48736743696 has 45 divisors (see below), whose sum is σ = 136402606821. Its totient is φ = 16244698176.
The previous prime is 48736743661. The next prime is 48736743697. The reversal of 48736743696 is 69634763784.
The square root of 48736743696 is 220764.
It is a perfect power (a square), and thus also a powerful number.
48736743696 is a `hidden beast` number, since 4 + 87 + 36 + 7 + 436 + 96 = 666.
48736743696 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 44175632400 + 4561111296 = 210180^2 + 67536^2 .
It is not an unprimeable number, because it can be changed into a prime (48736743697) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2639970 + ... + 2658366.
Almost surely, 248736743696 is an apocalyptic number.
48736743696 is the 220764-th square number.
It is an amenable number.
48736743696 is an abundant number, since it is smaller than the sum of its proper divisors (87665863125).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48736743696 is an frugal number, since it uses more digits than its factorization.
48736743696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36808 (or 18402 counting only the distinct ones).
The product of its digits is 109734912, while the sum is 63.
The spelling of 48736743696 in words is "forty-eight billion, seven hundred thirty-six million, seven hundred forty-three thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •