Base | Representation |
---|---|
bin | 1011100100001… |
… | …0011100001001 |
3 | 10101021101120222 |
4 | 2321002130021 |
5 | 44404203013 |
6 | 4451355425 |
7 | 1126204520 |
oct | 271023411 |
9 | 111241528 |
10 | 48506633 |
11 | 2542082a |
12 | 142b2b75 |
13 | a084766 |
14 | 66294b7 |
15 | 43d2508 |
hex | 2e42709 |
48506633 has 4 divisors (see below), whose sum is σ = 55436160. Its totient is φ = 41577108.
The previous prime is 48506629. The next prime is 48506683. The reversal of 48506633 is 33660584.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 48506633 - 22 = 48506629 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48506593 and 48506602.
It is not an unprimeable number, because it can be changed into a prime (48506603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3464753 + ... + 3464766.
It is an arithmetic number, because the mean of its divisors is an integer number (13859040).
Almost surely, 248506633 is an apocalyptic number.
It is an amenable number.
48506633 is a deficient number, since it is larger than the sum of its proper divisors (6929527).
48506633 is an equidigital number, since it uses as much as digits as its factorization.
48506633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6929526.
The product of its (nonzero) digits is 51840, while the sum is 35.
The square root of 48506633 is about 6964.6703439574. The cubic root of 48506633 is about 364.6982757024.
The spelling of 48506633 in words is "forty-eight million, five hundred six thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •