Base | Representation |
---|---|
bin | 101101100100110010… |
… | …011110011011010001 |
3 | 11200022101221201122121 |
4 | 231210302132123101 |
5 | 1300210002444211 |
6 | 34251455334241 |
7 | 3351445453222 |
oct | 554462363321 |
9 | 150271851577 |
10 | 48935593681 |
11 | 19831959907 |
12 | 9598521381 |
13 | 47cb3a20c0 |
14 | 2523219249 |
15 | 14161e0271 |
hex | b64c9e6d1 |
48935593681 has 8 divisors (see below), whose sum is σ = 54124191464. Its totient is φ = 43950470400.
The previous prime is 48935593673. The next prime is 48935593741. The reversal of 48935593681 is 18639553984.
It can be written as a sum of positive squares in 4 ways, for example, as 2210880400 + 46724713281 = 47020^2 + 216159^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 48935593681 - 23 = 48935593673 is a prime.
It is a super-2 number, since 2×489355936812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48935593601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50868120 + ... + 50869081.
It is an arithmetic number, because the mean of its divisors is an integer number (6765523933).
Almost surely, 248935593681 is an apocalyptic number.
It is an amenable number.
48935593681 is a deficient number, since it is larger than the sum of its proper divisors (5188597783).
48935593681 is a wasteful number, since it uses less digits than its factorization.
48935593681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101737251.
The product of its digits is 27993600, while the sum is 61.
The spelling of 48935593681 in words is "forty-eight billion, nine hundred thirty-five million, five hundred ninety-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •