Base | Representation |
---|---|
bin | 1011100010111… |
… | …0111011110101 |
3 | 10101010100000000 |
4 | 2320232323311 |
5 | 44344123431 |
6 | 4445541513 |
7 | 1125422556 |
oct | 270567365 |
9 | 111110000 |
10 | 48426741 |
11 | 25376800 |
12 | 14274899 |
13 | a05729c |
14 | 660832d |
15 | 43b89e6 |
hex | 2e2eef5 |
48426741 has 54 divisors (see below), whose sum is σ = 81148886. Its totient is φ = 28868400.
The previous prime is 48426691. The next prime is 48426797. The reversal of 48426741 is 14762484.
48426741 = 1083 + 1093 + ... + 1343.
It can be written as a sum of positive squares in only one way, i.e., 28579716 + 19847025 = 5346^2 + 4455^2 .
It is not a de Polignac number, because 48426741 - 27 = 48426613 is a prime.
It is a Duffinian number.
It is a nialpdrome in base 9.
It is a zygodrome in base 9.
It is a junction number, because it is equal to n+sod(n) for n = 48426696 and 48426705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48426541) 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 53 ways as a sum of consecutive naturals, for example, 793851 + ... + 793911.
Almost surely, 248426741 is an apocalyptic number.
It is an amenable number.
48426741 is a deficient number, since it is larger than the sum of its proper divisors (32722145).
48426741 is an frugal number, since it uses more digits than its factorization.
48426741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107 (or 75 counting only the distinct ones).
The product of its digits is 43008, while the sum is 36.
The square root of 48426741 is about 6958.9324612328. The cubic root of 48426741 is about 364.4979423752.
It can be divided in two parts, 484 and 26741, that added together give a square (27225 = 1652).
The spelling of 48426741 in words is "forty-eight million, four hundred twenty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •