Base | Representation |
---|---|
bin | 1011101010111… |
… | …1101110010101 |
3 | 10102010010121210 |
4 | 2322233232111 |
5 | 100013014021 |
6 | 4505132033 |
7 | 1133050536 |
oct | 272575625 |
9 | 112103553 |
10 | 48954261 |
11 | 256a7074 |
12 | 1448a019 |
13 | a1b0425 |
14 | 670468d |
15 | 446ee76 |
hex | 2eafb95 |
48954261 has 8 divisors (see below), whose sum is σ = 65336544. Its totient is φ = 32604080.
The previous prime is 48954259. The next prime is 48954263. The reversal of 48954261 is 16245984.
It is an interprime number because it is at equal distance from previous prime (48954259) and next prime (48954263).
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 48954261 - 21 = 48954259 is a prime.
It is a super-2 number, since 2×489542612 = 4793039340112242, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48954263) 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 7 ways as a sum of consecutive naturals, for example, 4206 + ... + 10751.
It is an arithmetic number, because the mean of its divisors is an integer number (8167068).
Almost surely, 248954261 is an apocalyptic number.
It is an amenable number.
48954261 is a deficient number, since it is larger than the sum of its proper divisors (16382283).
48954261 is a wasteful number, since it uses less digits than its factorization.
48954261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16051.
The product of its digits is 69120, while the sum is 39.
The square root of 48954261 is about 6996.7321658043. The cubic root of 48954261 is about 365.8166763840.
The spelling of 48954261 in words is "forty-eight million, nine hundred fifty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •