Base | Representation |
---|---|
bin | 101100111010001000… |
… | …111101000000101101 |
3 | 11121110112120010222100 |
4 | 230322020331000231 |
5 | 1242223314101322 |
6 | 34052455205313 |
7 | 3324636540216 |
oct | 547210750055 |
9 | 147415503870 |
10 | 48220065837 |
11 | 194a4a74189 |
12 | 9418976839 |
13 | 4716087048 |
14 | 249619c40d |
15 | 13c34a1dac |
hex | b3a23d02d |
48220065837 has 24 divisors (see below), whose sum is σ = 74464363584. Its totient is φ = 29961972864.
The previous prime is 48220065821. The next prime is 48220065931. The reversal of 48220065837 is 73856002284.
48220065837 is a `hidden beast` number, since 48 + 2 + 20 + 0 + 6 + 583 + 7 = 666.
It is not a de Polignac number, because 48220065837 - 24 = 48220065821 is a prime.
It is a super-2 number, since 2×482200658372 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 48220065792 and 48220065801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48220065637) 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 23 ways as a sum of consecutive naturals, for example, 1514163 + ... + 1545680.
It is an arithmetic number, because the mean of its divisors is an integer number (3102681816).
Almost surely, 248220065837 is an apocalyptic number.
It is an amenable number.
48220065837 is a deficient number, since it is larger than the sum of its proper divisors (26244297747).
48220065837 is a wasteful number, since it uses less digits than its factorization.
48220065837 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3059969 (or 3059966 counting only the distinct ones).
The product of its (nonzero) digits is 645120, while the sum is 45.
The spelling of 48220065837 in words is "forty-eight billion, two hundred twenty million, sixty-five thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •